Results 41 to 50 of about 808 (100)
, 2012 The competition graph of a digraph $D$ is a (simple undirected) graph which has the same vertex set as $D$ and has an edge between two distinct vertices $x$ and $y$ if and only if there exists a vertex $v$ in $D$ such that $(x,v)$ and $(y,v)$ are arcs of
Boram Park +8 more
core +1 more source
Journal of Mathematics, Volume 2025, Issue 1, 2025.In its crystalline state, the α‐icosahedral nanosheet of boron demonstrates superconductivity and thermal electronic properties. Mathematical research on a graph’s structure yields a graph descriptor, a numerical measure. Chemical graph theory employs connectivity descriptors to analyze molecular structures, providing crucial insights into many ...
Khalil Hadi Hakami +3 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
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 competition number of a graph and the dimension of its hole space
, 2011 The competition graph of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D.
Boram Park +16 more
core +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
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
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