Results 31 to 40 of about 144 (108)
, 2022 HexCycleSpanner to tighten Directed Hamiltonian Circuit CycleExpander to construct Directed Hamiltonian Circuit Dr.(Prof.) Keshava Prasad Halemane, Professor - retired from Department of Mathematical And Computational Sciences ...
HALEMANE, KESHAVA PRASAD
core +1 more source
Maximal Independent Sets In Graphs With At Most r Cycles
, 2005 Key Words: cycle, ear decomposition, maximal independent set AMS classification: Primary 05C35; Secondary 05C38, 05C69. We find the maximum number of maximal independent sets in two families of graphs.
Vincent R. Vatter +11 more
core +1 more source
The Strong 3-Rainbow Index of Graphs Containing Three Cycles
, 2023 The concept of a strong k-rainbow index is a generalization of a strong rainbow connection number, which has an interesting application in security systems in a communication network.
Zata Yumni Awanis
core +1 more source
Matchings Extend to Hamiltonian Cycles in 5-Cube
Discussiones Mathematicae Graph Theory, 2018 Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? Fink confirmed that every perfect matching can be extended to a Hamiltonian cycle of Qn, thus solved Kreweras’ conjecture.
Wang Fan, Zhao Weisheng
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
On q-Power Cycles in Cubic Graphs
Discussiones Mathematicae Graph Theory, 2017 In the context of a conjecture of Erdős and Gyárfás, we consider, for any q ≥ 2, the existence of q-power cycles (i.e., with length a power of q) in cubic graphs. We exhibit constructions showing that, for every q ≥ 3, there exist arbitrarily large cubic
Bensmail Julien
doaj +1 more source
A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2016 Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f1-heavy, if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K)
Wideł Wojciech
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2022 A graph is called Hamiltonian extendable if there exists a Hamiltonian path between any two nonadjacent vertices. In this paper, we give an explicit formula of the minimum number of edges for Hamiltonian extendable graphs and we also characterize the ...
Yang Xiaojing, Xiong Liming
doaj +1 more source
Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers
Journal of Mathematics, Volume 2025, Issue 1, 2025.A lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions.
M. A. AbdAllah +4 more
wiley +1 more source
On The Set-Theoretic Complete Intersection Property for the Edge Ideals of Whisker Graphs [PDF]
, 2014 We show that the edge ideals of some whisker graphs are set-theoretic complete intersections.
Macchia, Antonio
core