Results 1 to 10 of about 138,722 (163)
Generation of Cubic graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Discrete ...
Gunnar Brinkmann +2 more
doaj +10 more sources
Discussiones Mathematicae Graph Theory, 2016 We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi Lorenzo
doaj +5 more sources
International Journal of Analysis and Applications, 2018 We introduce certain concepts, including cubic graphs, internal cubic graphs, external cubic graphs, and illustrate these concepts by examples. We deal with fundamental operations, Cartesian product, composition, union and join of cubic graphs.
Sheikh Rashid +3 more
doaj +7 more sources
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures [PDF]
Scientific ReportsThe well-known topic of crisp graph planarity is contrasted with the more new and thoroughly studied field of planarity inside a fuzzy framework. In cubic fuzzy domain, cubic multisets with interval and fuzzy number to capture vagueness.
Deivanai Jaisankar +2 more
doaj +2 more sources
On almost hypohamiltonian graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.
Jan Goedgebeur, Carol T. Zamfirescu
doaj +6 more sources
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 +2 more sources
Gromov hyperbolic cubic graphs
Open Mathematics, 2012 Abstract If X is a geodesic metric space and x 1; x 2; x 3 ∈ X, a geodesic triangle T = {x 1; x 2; x 3} is the union of the three geodesics [x 1 x
Pestana Domingo +3 more
doaj +2 more sources
On the genera of polyhedral embeddings of cubic graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given cubic graph and
Gunnar Brinkmann +2 more
doaj +1 more source
On the expected number of perfect matchings in cubic planar graphs [PDF]
, 2021 A well-known conjecture by Lov\'asz and Plummer from the 1970s asserted that a bridgeless cubic graph has exponentially many perfect matchings. It was solved in the affirmative by Esperet et al. (Adv. Math. 2011).
Noy, Marc +2 more
core +3 more sources
On Development of Neutrosophic Cubic Graphs with Applications in Decision Sciences
Journal of Function Spaces, 2022 In this study, the neutrosophic cubic graphs are further developed. We discussed and explored the open and the closed neighborhood for any vertex in neutrosophic cubic graphs, regular and totally regular neutrosophic cubic graphs, complete neutrosophic ...
Fazeelat Sultana +6 more
doaj +1 more source