Results 21 to 30 of about 303 (83)
Toughness, Forbidden Subgraphs and Pancyclicity [PDF]
, 2021 Motivated 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
Broersma, Hajo; id_orcid +5 more
core +1 more source
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
Chvátal-Erdős condition for pancyclicity [PDF]
, 2023 An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$.
Sudakov, Benny +2 more
core
Characterizing heavy subgraph pairs for pancyclicity [PDF]
, 2015 Earlier results originating from Bedrossian’s PhD Thesis focus on characterizing pairs of forbidden subgraphs that imply hamiltonian properties. Instead of forbidding certain induced subgraphs, here we relax the requirements by imposing Ore-type degree ...
Broersma, Hajo; id_orcid +3 more
core +1 more source
A generalization of Bondy’s pancyclicity theorem [PDF]
, 2023 The bipartite independence number of a graph $G$, denoted as $\tilde\alpha(G)$, is the minimal number $k$ such that there exist positive integers $a$ and $b$ with $a+b=k+1$ with the property that for any two sets $A,B\subseteq V(G)$ with $|A|=a$ and $|B|=
Sudakov, Benny +2 more
core +1 more source
Pancyclicity of Mobius cubes with faulty nodes
, 2006 An interconnection network with n nodes is four-pancyclic if it contains a cycle of length l for each integer l with 4
Yang, X. +3 more
core +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
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
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
Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs
Journal of Graph Theory, Volume 112, Issue 2, Page 37-53, June 2026.ABSTRACT Let G n , n c denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n vertices, that is, in which every edge is assigned a color. A cycle C in G n , n c is called properly colored if any two consecutive edges of C have distinct colors.
Tingting Han +3 more
wiley +1 more source