Results 21 to 30 of about 105 (94)
Discrete Applied Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Randerath, Bert +3 more
openaire +1 more source
Journal of Combinatorial Theory, Series B, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bollobás, Béla, Thomason, Andrew
openaire +2 more sources
Toughness, Forbidden Subgraphs and Pancyclicity [PDF]
Graphs and Combinatorics, 2021 AbstractMotivated by several conjectures due to Nikoghosyan, in a recent article due to Li et al., the aim was to characterize all possible graphs H such that every 1-tough H-free graph is hamiltonian. The almost complete answer was given there by the conclusion that every proper induced subgraph H of $$K_1\cup P_4$$
Wei Zheng, Hajo Broersma, Ligong Wang
openaire +2 more sources
Journal of Combinatorial Theory, Series B, 1976 Abstract A graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all lengths l, 3 ≤ l ≤ | V(G) |. Theorem . Let G be Hamiltonian and suppose that |E(G)| ≥ n 2 4 , where n = |V(G)|. Then G is either pancyclic or else is the complete bipartite graph K n 2 , n 2 .
Bondy, J.A, Ingleton, A.W
openaire +2 more sources
Computing Edge Weights of Magic Labeling on Rooted Products of Graphs
Mathematical Problems in Engineering, Volume 2020, Issue 1, 2020., 2020 Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain ...
Jia-Bao Liu +3 more
wiley +1 more source
Electronic Journal of Graph Theory and Applications, 2021 The d-Fibonacci digraphs F(d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs.
C. Dalfó, M.A. Fiol
doaj +1 more source
Fan's condition on induced subgraphs for circumference and pancyclicity [PDF]
Opuscula Mathematica, 2017 Let \(\mathcal{H}\) be a family of simple graphs and \(k\) be a positive integer. We say that a graph \(G\) of order \(n\geq k\) satisfies Fan's condition with respect to \(\mathcal{H}\) with constant \(k\), if for every induced subgraph \(H\) of \(G ...
Wojciech Wideł
doaj +1 more source
The cubic power graph of finite abelian groups
AKCE International Journal of Graphs and Combinatorics, 2021 Let G be a finite abelian group with identity 0. For an integer the additive power graph of G is the simple undirected graph with vertex set G in which two distinct vertices x and y are adjacent if and only if x + y = nt for some with When the additive ...
R. Raveendra Prathap, T. Tamizh Chelvam
doaj +1 more source
Alternating-Pancyclism in 2-Edge-Colored Graphs
Discussiones Mathematicae Graph Theory, 2021 An alternating cycle in a 2-edge-colored graph is a cycle such that any two consecutive edges have different colors. Let G1, . . ., Gkbe a collection of pairwise vertex disjoint 2-edge-colored graphs. The colored generalized sum of G1, . . ., Gk, denoted
Cordero-Michel Narda +1 more
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