Results 81 to 90 of about 1,031 (124)
Global cycle properties in graphs with large minimum clustering coefficient
, 2016 The clustering coefficient of a vertex in a graph is the proportion of neighbours of the vertex that are adjacent. The minimum clustering coefficient of a graph is the smallest clustering coefficient taken over all vertices.
Borchert, Adam +2 more
core
A characterization of pancyclic complements of line graphs
Discrete Mathematics, 2005 AbstractWe characterize graphs G such that the complements of their line graphs are pancyclic.
openaire +2 more sources
Edge-pancyclic block-intersection graphs
Discrete Mathematics, 1991 AbstractIt is shown that the block-intersection graph of both a balanced incomplete block design with block size at least 3 and λ = 1, and a transversal design is edge-pancyclic.
Donovan R. Hare, Brian Alspach
openaire +2 more sources
Pancyclism and Bipancyclism of Hamiltonian Graphs
Journal of Combinatorial Theory, Series B, 1994 AbstractIn this paper, we prove the following two theorems: (1) If G is a hamiltonian graph of order n and if there exists a vertex x ∈ V(G) such that d(x) + d(y) ≥ n for each y not adjacent to x, then G is either pancyclic or the complete bipartite graph K(n/2, n/2). (2) Let G=(X, Y; E) be a hamiltonian bipartite graph with |X| = |Y| = n > 3. If there
openaire +2 more sources
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order [PDF]
, 2002 Brett Stevens
openalex +1 more source
Resilient Pancyclicity of Random and Pseudorandom Graphs [PDF]
, 2010 Michael Krivelevich +2 more
openalex +1 more source
Pancyclic Hamilton cycles in random graphs
Discrete Mathematics, 1991 AbstractLet G(n,p) denote the probability space of the set G of graphs G = (Vn, E) with vertex set Vn = {1,2,…, n} and edges E chosen independently with probability p from E={{u,v}:u,v∈Vn,u≠v}.A graph G∈G(n,p is defined to be pancyclic if, for all s, 3⩽s⩽n there is a cycle of size s on the edges of G. We show that the threshold probability p = (log n +
openaire +2 more sources
Some theorems of uniquely pancyclic graphs
Discrete Mathematics, 1986 AbstractIn this paper we discuss an unsolved problem in [1]: Determine which simple graph G has exactly one cycle of each length l, 3⩽l⩽ν (where ν is the number of the vertices of G). We call a graph with this property a uniquely pancyclic graph (UPC-graph). We solve this problem under the condition: G is an outerplanar graph.
openaire +2 more sources
Vertex pancyclicity in quasi-claw-free graphs
, 2008 Ellen X. Y. Qu, Wang Jiang-lu
openalex +1 more source