Results 21 to 30 of about 782 (111)
Spectral Sufficient Conditions on Pancyclic Graphs
Complexity, Volume 2021, Issue 1, 2021., 2021 A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n. In fact, it is NP‐complete that deciding whether a graph is pancyclic. Because the spectrum of graphs is convenient to be calculated, in this study, we try to use the spectral theory of graphs to study this problem and give some sufficient conditions for a graph to
Guidong Yu +4 more
wiley +1 more source
Computing Edge Weights of Symmetric Classes of Networks
Mathematical Problems in Engineering, Volume 2021, Issue 1, 2021., 2021 Accessibility, robustness, and connectivity are the salient structural properties of networks. The labelling of networks with numeric numbers using the parameters of edge or vertex weights plays an eminent role in the study of the aforesaid properties.
Hafiz Usman Afzal +4 more
wiley +1 more source
Pancyclicity in the Cartesian Product (K9-C9)n [PDF]
Social Science Research Network, 2022 A graph G on m vertices is pancyclic if it contains cycles of length l , 3 ≤ l ≤ m as subgraphs in G . The complete graph K 9 on 9 vertices with a cycle C 9 of length 9 deleted from K 9 is denoted by ( K 9 − C 9 ).
Syeda Afiya, Rajesh M
semanticscholar +1 more source
Enumeration of the Edge Weights of Symmetrically Designed Graphs
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 The idea of super (a, 0)‐edge‐antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super (a, 0)‐edge‐antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies of C4 and different trees.
Muhammad Javaid +3 more
wiley +1 more source
PANCYCLICITY IN LINE GRAPHS [PDF]
Acta Mathematica Scientia, 1998 For a graph \(G\), let \(\overline {\sigma}_2\) denote min\(\{ d(u) + d(v)\mid uv \in E(G) \}\). The author shows that if \(G\) is connected and of order \(n \geq 43\) such that the line graph \(L(G)\) is Hamiltonian and \(\overline {\sigma}_2> 2(n/5 - 1)\), then \(L(G)\) is pancyclic. This settles a conjecture of Benhocine et al. For a connected graph
Daniela Ferrero, Linda Lesniak
openaire +6 more sources
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
Hamiltonicity and pancyclicity of superclasses of claw-free graphs
Filomat, 2023 A graph G is called to be fully cycle extendable graph [3] if each vertex of G belongs to a triangle and for any cycle C with |V(C)| < |V(G)| there exists a cycle C? in G such that V(C) ? V(C?) and |V(C?)| = |V(C)|+1. In this paper, we show that every
Abdelkader Sahraoui, Zineb Benmeziane
semanticscholar +1 more source
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