Discrete Math For Computer Science - Chapter 3: Predicates And Quantifiers: Quantified Statements,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 3: Predicates And Quantifiers: Quantified Statements, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 1: Proposition, Logical Operations, And Conditional Statements,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 1: Proposition, Logical Operations, And Conditional Statements, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 22: Counting By Complement: Permutations With Repetitions: Inclusion/Exclusion Principle,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 22: Counting By Complement: Permutations With Repetitions: Inclusion/Exclusion Principle, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 20: Sum And Product Rules,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 20: Sum And Product Rules, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 25: Conditional Probability And Independence,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 25: Conditional Probability And Independence, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 24: Unions And Complements Of Events,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 24: Unions And Complements Of Events, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 17: The Division Algorithm: Modular Arithmetic,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 17: The Division Algorithm: Modular Arithmetic, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 23: Probability Of An Event,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 23: Probability Of An Event, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 12: Introduction To Binary Relations,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 12: Introduction To Binary Relations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 21: Counting Permutations And Subsets,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 21: Counting Permutations And Subsets, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 18: Prime Factorization: Gcd And Euclid’S Algorithm,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 18: Prime Factorization: Gcd And Euclid’S Algorithm, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 9: Cartesian Products,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 9: Cartesian Products, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 10: Definition Of Functions: Properties Of Functions,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 10: Definition Of Functions: Properties Of Functions, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 6: Proofs By Contradiction: Proofs By Cases,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 6: Proofs By Contradiction: Proofs By Cases, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 5: Direct Proofs: Proofs By Contrapositive,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 5: Direct Proofs: Proofs By Contrapositive, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 7: Sets And Subsets: Set Of Sets,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 7: Sets And Subsets: Set Of Sets, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
On Realizability Of Some Graphs,
2025
The University of Memphis
On Realizability Of Some Graphs, Runze Wang
Communications on Number Theory and Combinatorial Theory
A graph H is said to be realizable by a graph G if for any vertex v in G, the induced subgraph of G on the neighborhood of v is isomorphic to H. In this paper, we show that a complete multipartite graph is realizable if and only if each of its parts has the same size; characterize the graphs by which a complete multipartite graph with each part having the same size is realizable; show that all cluster graphs are realizable; prove that a wheel is realizable if and only if it has four vertices; prove that …
Two Families Of Graceful Cacti,
2025
University of South Florida, Tampa
Two Families Of Graceful Cacti, Christian Barrientos
Communications on Number Theory and Combinatorial Theory
We present a graceful labeling for each member of a subfamily of quadrangular cacti whose underlying graph correspond to the subclass of rooted binary trees where every level has at most two vertices. We also prove the existence of an $\alpha$-labeling (the most restricted type of graceful labeling) for all cyclic snakes, i.e., those cacti whose blocks are copies of the cycle $C_{4n}$ and its maximum degree is four.
Face-Magic Labelings Of Polygonal Graphs,
2025
The Chinese University of Hong Kong
Face-Magic Labelings Of Polygonal Graphs, Wai Chee Shiu, Richard M. Low, Andy K. Liu
Theory & Applications of Graphs
For a plane graph $G = (V, E)$ embedded in $\mathbb{R}^2$, let $\mathcal{F}(G)$ denote the set of faces of $G$. Then, $G$ is called a \textit{$C_n$-face-magic graph} if there exists a bijection $f: V(G) \to \{1, 2, \dots, |V(G)|\}$ such that for any $F \in \mathcal{F}(G)$ with $F \cong C_n$, the sum of all the vertex labels along $C_n$ is a constant $c$. In this paper, we investigate face-magic labelings of polygonal graphs.
A Characterization Of Chordal Graph Without Sun And Co-Rising Sun As Convex Geometry,
2025
Universidad Nacional de La Plata
A Characterization Of Chordal Graph Without Sun And Co-Rising Sun As Convex Geometry, Silvia B. Tondato
Theory & Applications of Graphs
In this paper we introduce the notion of $t_3$ \textit{convexity}, a natural restriction of triangle convexity. A \textit{triangle path} is a path allowing just short chords. A triangle path $P$ between two non-adjacent vertices in a graph $G$ is called $t_3$ \textit{path} if the first vertex of $P$ is among vertices from $P$ adjacent only to the second vertex of $P$, and the last vertex of $P$ is among vertices from $P$ adjacent only to the second-last vertex of $P$. A set $S \subseteq V(G)$ is $t_3$ \textit{convex} if for any two non-adjacent vertices $x, y \in S$ any vertex …
