Results 121 to 130 of about 1,699 (154)
Some of the next articles are maybe not open access.
Pancyclicity of circulant digraphs
Discrete Applied MathematicsZ. R. Bogdanowicz
openaire +2 more sources
Pancyclicity in switching classes
Information Processing Letters, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ehrenfeucht, A. +3 more
openaire +2 more sources
(n - 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
International Journal of Foundations of Computer Science, 2021As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost.
Xirong Xu +4 more
semanticscholar +1 more source
Vertex‐pancyclicity of hypertournaments
Journal of Graph Theory, 2009AbstractA hypertournament or a k‐tournament, on n vertices, 2≤k≤n, is a pair T=(V, E), where the vertex set V is a set of size n and the edge set E is the collection of all possible subsets of size k of V, called the edges, each taken in one of its k! possible permutations.
openaire +3 more sources
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
Journal of Graph Theory, 2020A digraph D with n vertices is Hamiltonian (pancyclic and vertex‐pancyclic, respectively) if D contains a Hamilton cycle (a cycle of every length 3 , 4 , … , n , for every vertex v ∈ V ( D ) , a cycle of every length 3 , 4 , … , n through v ...
Zan-Bo Zhang +3 more
semanticscholar +1 more source
Edge-pancyclicity of pancake graph
International Journal of Computer Mathematics Computer Systems Theory, 2020Pancylicity was introduced by Bondy in 1971. A graph G with vertex set and edge set is pancyclic if it contains cycles of lengths l, for . This concept has been extended to edge-pancyclicity.
Chun-Nan Hung +3 more
semanticscholar +1 more source
Computer/law journal, 2019
A graph $G=(V,E)$ is two-disjoint-cycle-cover $[r_1,r_2]$-pancyclic if for any integer $l$ satisfying $r_1 \leq l \leq r_2$, there exist two vertex-disjoint cycles $C_1$ and $C_2$ in $G$ such that the lengths of $C_1$ and $C_2$ are $l$ and $|V(G)| - l$,
Tzu-Liang Kung +3 more
semanticscholar +1 more source
A graph $G=(V,E)$ is two-disjoint-cycle-cover $[r_1,r_2]$-pancyclic if for any integer $l$ satisfying $r_1 \leq l \leq r_2$, there exist two vertex-disjoint cycles $C_1$ and $C_2$ in $G$ such that the lengths of $C_1$ and $C_2$ are $l$ and $|V(G)| - l$,
Tzu-Liang Kung +3 more
semanticscholar +1 more source
Extending Vertex and Edge Pancyclic Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Megan Cream +2 more
openaire +1 more source
Journal of Graph Theory, 1994
AbstractLet D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ≅ A(D), or dD+(u) + dD−(v) ≧ n − 3.
openaire +2 more sources
AbstractLet D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ≅ A(D), or dD+(u) + dD−(v) ≧ n − 3.
openaire +2 more sources
2016
Recall that a pancyclic graph is called uniquely pancyclic, or UPC, if it contains exactly one cycle of every possible length. In 1973, Roger Entringer asked (see Bondy (J. Combinatorial Theory (B) 11:80–84, 1971), p. 247), for what orders do UPC graphs exist?
John C. George +2 more
openaire +1 more source
Recall that a pancyclic graph is called uniquely pancyclic, or UPC, if it contains exactly one cycle of every possible length. In 1973, Roger Entringer asked (see Bondy (J. Combinatorial Theory (B) 11:80–84, 1971), p. 247), for what orders do UPC graphs exist?
John C. George +2 more
openaire +1 more source