Results 131 to 140 of about 1,777 (160)
Some of the next articles are maybe not open access.
International Journal of Computer Mathematics: Computer Systems Theory
A graph $G$ $=$ $(V,E)$ is vertex-pancyclic if for every vertex $u$ and any integer $l$ ranging from $3$ to $|V|$, $G$ contains a cycle $C$ of length $l$ such that $u$ is on $C$. A bipartite graph $G$ $=$ $(V,E)$ is vertex-bipancyclic if for every vertex
Yasong Liu, Huazhong Lü
semanticscholar +1 more source
A graph $G$ $=$ $(V,E)$ is vertex-pancyclic if for every vertex $u$ and any integer $l$ ranging from $3$ to $|V|$, $G$ contains a cycle $C$ of length $l$ such that $u$ is on $C$. A bipartite graph $G$ $=$ $(V,E)$ is vertex-bipancyclic if for every vertex
Yasong Liu, Huazhong Lü
semanticscholar +1 more source
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
Information Processing Letters, 2007For two distinct vertices u,[email protected]?V(G), a cycle is called geodesic cycle with u and v if a shortest path of G joining u and v lies on the cycle; and a cycle C is called balanced cycle with u and v if d"C(u,v)=max{d"C(x,y)|x,[email protected]?V(C)}. A graph G is pancyclic [J. Mitchem, E. Schmeichel, Pancyclic and bipancyclic graphs a survey,
Chang-Hsiung Tsai +2 more
openaire +1 more source
Pancyclicity in switching classes
Information Processing Letters, 2000Abstract Switching classes of graphs were introduced by van Lint and Seidel in the context of equiangular lines in elliptic geometry. We show that every switching class, except the class of all complete bipartite graphs, contains a pancyclic graph.
Grzegorz Rozenberg +3 more
openaire +3 more sources
Cycle-pancyclism in tournaments I
Graphs and Combinatorics, 1995LetT be a hamiltonian tournament withn vertices and? a hamiltonian cycle ofT. In this paper we start the study of the following question: What is the maximum intersection with? of a cycle of lengthk? This number is denotedf(n, k). We prove that fork in range, 3 ≤k ≤n + 4/2,f(n,k) ? k ?
Sergio Rajsbaum +1 more
openaire +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
On the Pancyclicity of Lexicographic Products
Graphs and Combinatorics, 2006We prove that if G and H are graphs containing at least one edge each, then their lexicographic product G[H] is weakly pancyclic, i. e., it contains a cycle of every length between the length of a shortest cycle and that of a longest one. This supports some conjectures on locally connected graphs and on product graphs.
Matthias Kriesell +2 more
openaire +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
Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
Theoretical Computer Science, 2023Hongwei Qiao, J. Meng
semanticscholar +1 more source
Two-Disjoint-Cycle-Cover Pancyclicity of Augmented Cubes
Journal of the Operations Research Society of China, 2023Shu-jie Zhou, Min Xu
semanticscholar +1 more source