Results 71 to 80 of about 782 (111)

Rainbow edge-pancyclicity of strongly edge-colored graphs

Theoretical Computer Science, 2022
In an edge-colored graph G , a subgraph is rainbow if all its edges have different colors. A strongly edge-colored graph is an edge-colored graph in which each path of length three is rainbow.
Luyi Li, Xueliang Li
semanticscholar   +1 more source

s-Vertex Pancyclic Index

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Lili, Shao, Yehong, Chen, Guihai, Xu, Xinping, Zhou, Ju   +4 more
openaire   +2 more sources

Cycle-pancyclism in tournaments I

Graphs and Combinatorics, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galeana-Sánchez, Hortensia, Rajsbaum, Sergio   +1 more
openaire   +1 more source

Rainbow vertex-pancyclicity of strongly edge-colored graphs

Discrete Mathematics, 2021
A strongly edge-colored graph is an edge-colored graph in which every path of length 3 is rainbow or, equivalently, every monochromatic subgraph is an induced matching.
Maoqun Wang, Jianguo Qian
semanticscholar   +1 more source

Node-pancyclicity and edge-pancyclicity of crossed cubes

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan, Jianxi, Lin, Xiaola, Jia, Xiaohua
openaire   +2 more sources

Pancyclicity in switching classes

Information Processing Letters, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.   +3 more
openaire   +2 more sources

Pancyclicity of circulant digraphs

Discrete Applied Mathematics
Z. R. Bogdanowicz
semanticscholar   +2 more sources

\((n-2)\)-Fault-Tolerant Edge-Pancyclicity of Möbius Cubes \(MQ_n\)

Ars Comb.
The \( n \)-dimensional Möbius cube \( MQ_n \) is an important variant of the hypercube \( Q_n \), which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of \( MQ_n \), and shows that if \(
Huifeng Zhang, Jun Zhu, Xirong Xu, Peng Zhang   +3 more
semanticscholar   +1 more source

(n - 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn

International Journal of Foundations of Computer Science, 2021
As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost.
Xirong Xu, Huifeng Zhang, Ziming Wang, Qiang Zhang, P. Zhang   +4 more
semanticscholar   +1 more source

The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube

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