Results 31 to 40 of about 782 (111)
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
Pancyclicity of the n-Generalized Prism over Skirted Graphs
Symmetry, 2022 A side skirt is a planar rooted tree T, T≠P2, where the root of T is a vertex of degree at least two, and all other vertices except the leaves are of degree at least three.
Artchariya Muaengwaeng +2 more
semanticscholar +1 more source
Pancyclicity when each Cycle Must Pass Exactly k Hamilton Cycle Chords
Discussiones Mathematicae Graph Theory, 2015 It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, Θ(n) chords are required.
Affif Chaouche Fatima +2 more
doaj +1 more source
Pancyclicity of randomly perturbed digraph
JUSTC, 2022 Dirac’s theorem states that if a graph G on n vertices has a minimum degree of at least \begin{document}$\displaystyle \frac{n}{2}$\end{document}, then G contains a Hamiltonian cycle. Bohman et al.
Zelin Ren, Xinmin Hou
semanticscholar +1 more source
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Proceedings of the London Mathematical Society, Volume 109, Issue 3, Page 733-762, September 2014., 2014 A conjecture of Thomassen from 1982 states that, for every k, there is an f(k) so that every strongly f(k)‐connected tournament contains k edge‐disjoint Hamilton cycles. A classical theorem of Camion, that every strongly connected tournament contains a Hamilton cycle, implies that f(1)=1. So far, even the existence of f(2) was open.
Daniela Kühn +3 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1999 It was shown by \textit{J. A. Bondy} [Stud. Sci. Math. Hung. 4, 473-475 (1969; Zbl 0184.27702)] that if \(G\) is a graph of order \(n\) in which \(d_G(x) + d_G(y) \geq n\) for each pair of nonadjacent vertices \(x\) and \(y\) of \(G\), then \(G\) is either pancyclic or the complete bipartite graph \(K_{n/2,n/2}\).
openaire +2 more sources
New Sufficient Conditions for Hamiltonian Paths
The Scientific World Journal, Volume 2014, Issue 1, 2014., 2014 A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.
M. Sohel Rahman +3 more
wiley +1 more source
On pancyclism in hamiltonian graphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kouider, Mekkia, Marczyk, Antoni
openaire +2 more sources
An Efficient Hierarchy Algorithm for Community Detection in Complex Networks
Mathematical Problems in Engineering, Volume 2014, Issue 1, 2014., 2014 Community structure is one of the most fundamental and important topology characteristics of complex networks. The research on community structure has wide applications and is very important for analyzing the topology structure, understanding the functions, finding the hidden properties, and forecasting the time‐varying of the networks.
Lili Zhang +5 more
wiley +1 more source
Forbidden subgraphs for chorded pancyclicity
Discrete Mathematics, 2017 We call a graph $G$ pancyclic if it contains at least one cycle of every possible length $m$, for $3\le m\le |V(G)|$. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length $4, 5, \ldots, |V(G)|
Megan Cream +2 more
openaire +3 more sources