Results 81 to 90 of about 635 (107)
Some of the next articles are maybe not open access.
Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings., 2003
The problem of containing pancyclic interconnection networks is an important research topic. An n-dimensional Mobius cube, MQ/sub n/, is a variant of hypercubes according to specific rules. In this paper, we prove that Mobius cubes are all pancyclic networks.
Wen-Tzeng Huang +2 more
openaire +1 more source
The problem of containing pancyclic interconnection networks is an important research topic. An n-dimensional Mobius cube, MQ/sub n/, is a variant of hypercubes according to specific rules. In this paper, we prove that Mobius cubes are all pancyclic networks.
Wen-Tzeng Huang +2 more
openaire +1 more source
Vertex pancyclic in-tournaments
Journal of Graph Theory, 2001An in-tournament is an oriented graph such that the in-neighborhood of every vertex induces a tournament. The authors investigate vertex \(k\)-pancyclicity of in-tournaments of order \(n\), where, for some \(k\) with \(3\leq k\leq n\), every vertex is in a cycle of length \(p\) for every \(p\) with \(3\leq p\leq n\). They provide sharp lower bounds for
Meike Tewes, Lutz Volkmann
openaire +2 more sources
Journal of Graph Theory, 1998
Summary: In generalizing the concept of a pancyclic graph, we say that a graph is ``weakly pancyclic'' if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic are considerably weaker than those required ...
Stephan Brandt +2 more
openaire +2 more sources
Summary: In generalizing the concept of a pancyclic graph, we say that a graph is ``weakly pancyclic'' if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic are considerably weaker than those required ...
Stephan Brandt +2 more
openaire +2 more sources
Acta Mathematica Scientia, 1998
For a graph \(G\), let \(\overline {\sigma}_2\) denote min\(\{ d(u) + d(v)\mid uv \in E(G) \}\). The author shows that if \(G\) is connected and of order \(n \geq 43\) such that the line graph \(L(G)\) is Hamiltonian and \(\overline {\sigma}_2> 2(n/5 - 1)\), then \(L(G)\) is pancyclic. This settles a conjecture of Benhocine et al. For a connected graph
openaire +2 more sources
For a graph \(G\), let \(\overline {\sigma}_2\) denote min\(\{ d(u) + d(v)\mid uv \in E(G) \}\). The author shows that if \(G\) is connected and of order \(n \geq 43\) such that the line graph \(L(G)\) is Hamiltonian and \(\overline {\sigma}_2> 2(n/5 - 1)\), then \(L(G)\) is pancyclic. This settles a conjecture of Benhocine et al. For a connected graph
openaire +2 more sources
Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang Lili 0002 +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang Lili 0002 +4 more
openaire +2 more sources
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
Pancyclicity of Strong Products of Graphs
Graphs and Combinatorics, 2004A graph with \(n\) vertices is pancyclic if it contains a cycle of length \(s\) for all \(s\), \(3\leq s\leq n\). In particular, a pancyclic graph is Hamiltonian. The {strong product} of \(k\) graphs \(G_1=(V_1,E_1),\dots, G_k=(V_k,E_k)\) is the graph \(G_1\times\cdots\times G_k\) with \(V_1\times\cdots \times V_k\) as set of vertices and two vertices \
Daniel Král +3 more
openaire +2 more sources
Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
Theoretical Computer Science, 2023Hongwei Qiao, Jixiang Meng
exaly