Results 51 to 60 of about 635 (107)
An upper bound for the crossing number of augmented cubes [PDF]
, 2012 A {\it good drawing} of a graph $G$ is a drawing where the edges are non-self-intersecting and each two edges have at most one point in common, which is either a common end vertex or a crossing.
Wang, Guoqing +4 more
core
A degree characterisation of pancyclicity
Discrete Mathematics, 1994 A graph \(G\) of order \(n\) is said to be in the class \(O(n-1)\) if \(\deg (u) + \deg (v) \geq n - 1\) for every pair of nonadjacent vertices \(u\), \(v \in V(G)\). The paper presents a characterisation of those graphs in \(O(n-1)\) which are pancyclic.
Robert E. L. Aldred +2 more
openaire +1 more source
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Pancyclism and Meyniel's conditions
Discrete Mathematics, 1986 \textit{H. Meyniel} [J. Comb. Theory, Ser. B 14, 137-147 (1973; Zbl 0259.05114)] has shown that a digraph of order n is Hamiltonian if for each pair of non adjacent vertices the degree sum is at least 2n-1. In accordance with \textit{J. A. Bondy's} metaconjecture [Proc. 2nd Louisiana Conf.
openaire +2 more sources
Edge-Fault Tolerance of Hypercube-like Networks [PDF]
, 2012 This paper considers a kind of generalized measure $\lambda_s^{(h)}$ of fault tolerance in a hypercube-like graph $G_n$ which contain several well-known interconnection networks such as hypercubes, varietal hypercubes, twisted cubes, crossed cubes and M\"
Li, Xiang-Jun, Xu, Jun-Ming
core
On the pancyclicity of 1-tough graphs [PDF]
Discrete Mathematics Letters, 2020 Rao Li
doaj +1 more source
Proceedings of the American Mathematical SocietyAn n n -vertex graph G
Bailey, Teegan, Li, Yupei, Luo, Ruth
openaire +2 more sources
On pancyclic representable matroids
Discrete Mathematics, 2005 A simple graph \(G\) with vertex set \(V(G)\) is pancyclic if it contains cycles of all lengths \(l\), for \(3 \leq l \leq | V(G| \). \textit{J. A. Bondy} [J. Comb. Theory, Ser. B 11, 80--84 (1971; Zbl 0183.52301)] proved that an \(n\)-vertex simple Hamiltonian graph with at least \(n^2/4\) edges is pancyclic unless it is isomorphic to \(K_{n/2,n/2}\).
Brian Beavers, James G. Oxley
openaire +1 more source
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
Discrete Mathematics, 1995 A digraph is semicomplete if it has no pair of non-adjacent vertices. A semicomplete multipartite digraph is a digraph that can be obtained from some semicomplete digraph \(D\) by choosing a (vertex) spanning collection of vertex disjoint induced subgraphs of \(D\) and deleting all arcs inside each of these.
openaire +6 more sources