Results 31 to 40 of about 78 (61)
Decompositions of Cubic Traceable Graphs
Discussiones Mathematicae Graph Theory, 2020 A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs.
Liu Wenzhong, Li Panpan
doaj +1 more source
The hyperbolicity constant of infinite circulant graphs
Open Mathematics, 2017 If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj +1 more source
Spectra of Orders for k-Regular Graphs of Girth g
Discussiones Mathematicae Graph Theory, 2021 A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n ...
Jajcay Robert, Raiman Tom
doaj +1 more source
More on the Minimum Size of Graphs with Given Rainbow Index
Discussiones Mathematicae Graph Theory, 2020 The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand et al., is a natural generalization of the rainbow connection number of a graph.
Zhao Yan
doaj +1 more source
On the Non-Inverse Graph of a Group
Discussiones Mathematicae - General Algebra and Applications, 2022 Let (G, *) be a finite group and S = {u ∈ G|u ≠ u−1}, then the inverse graph is defined as a graph whose vertices coincide with G such that two distinct vertices u and v are adjacent if and only if either u * v ∈ S or v * u ∈ S.
Amreen Javeria, Naduvath Sudev
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +2 more
doaj +1 more source
(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
Discussiones Mathematicae Graph Theory, 2022 The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbow et
Alizadeh Hadi +2 more
doaj +1 more source
Note on structural properties of graphs
Open Mathematics, 2022 In this paper, we establish sufficient and necessary conditions for the existence of abelian subgroups of maximal order of a finite group GG, by means of its commuting graph.
Arreola-Bautista Luis D. +3 more
doaj +1 more source
Criticality of Switching Classes of Reversible 2-Structures Labeled by an Abelian Group
Discussiones Mathematicae Graph Theory, 2017 Let V be a finite vertex set and let (𝔸, +) be a finite abelian group. An 𝔸-labeled and reversible 2-structure defined on V is a function g : (V × V) \ {(v, v) : v ∈ V } → 𝔸 such that for distinct u, v ∈ V, g(u, v) = −g(v, u).
Belkhechine Houmem +2 more
doaj +1 more source
Conflict-Free Vertex-Connections of Graphs
Discussiones Mathematicae Graph Theory, 2020 A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source