Results 61 to 70 of about 676 (119)

Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes [PDF]

, 2010
The $n$-dimensional hypercube network $Q_n$ is one of the most popular interconnection networks since it has simple structure and is easy to implement. The $n$-dimensional locally twisted cube, denoted by $LTQ_n$, an important variation of the hypercube,
Hung, Ruo-Wei
core  

Extremal Results on ℓ-Connected Graphs or Pancyclic Graphs Based on Wiener-Type Indices

Mathematics
A graph of order n is called pancyclic if it contains a cycle of length y for every 3≤y≤n. The connectivity of an incomplete graph G, denoted by κ(G), is min{|W||WisavertexcutofG}. A graph G is said to be ℓ-connected if the connectivity κ(G)≥ℓ.
Jing Zeng, Hechao Liu, Lihua You
doaj   +1 more source

Pancyclicity of Hamiltonian graphs

Journal of the European Mathematical Society
An n -vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is pancyclic if it contains cycles of all lengths from 3 up to
Nemanja Draganić, David Munhá Correia, Benny Sudakov   +2 more
openaire   +2 more sources

Two-Disjoint-Cycle-Cover Pancyclicity of Dragonfly Networks

Mathematics
Interconnection networks (often modeled as graphs) are critical for high-performance computing systems, as they have significant impact on performance metrics like latency and bandwidth.
Zengxian Tian, Guanlin He
doaj   +1 more source

Sifat - Sifat Graf Yang Memuat Semua SIklus [PDF]

Graf merupakan pasangan himpunan berhingga yang anggotanya disebut himpunan titik dan himpunan yang anggotanya adalah pasangan titik yang disebut sisi. Banyaknya sisi yang terkait pada satu titik merupakan derajat titik tersebut. Suatu graf yang memiliki
Oktaviani, Nur Rohmah
core   +3 more sources

Edge-pancyclicity of coupled graphs

Discrete Applied Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lih, Ko-Wei, Zengmin, Song, Weifan, Wang, Kemin, Zhang   +3 more
openaire   +2 more sources

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, Nicol, Skylar, Oellermann, Ortrud R.   +2 more
core  

Edge-pancyclic block-intersection graphs

Discrete Mathematics, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alspach, Brian, Hare, Donovan
openaire   +2 more sources

Pancyclicity in claw-free graphs

Discrete Mathematics, 2002
A graph \(G\) is subpancyclic if it contains cycles of every length \(m\) with \(3\leq m\leq c(G)\), where \(c(G)\) denotes the circumference of \(G\). The authors present several conditions for claw-free graphs, which guarantee the graphs are subpancyclic.
Gould, R.J., Pfender, F.
openaire   +1 more source

Chorded k-pancyclic and weakly k-pancyclic graphs

Discussiones Mathematicae Graph Theory
Summary: As natural relaxations of pancyclic graphs, we say a graph \(G\) is \(k\)-pancyclic if \(G\) contains cycles of each length from \(k\) to \(|V(G)|\) and \(G\) is weakly pancyclic if it contains cycles of all lengths from the girth to the circumference of \(G\), while \(G\) is weakly \(k\)-pancyclic if it contains cycles of all lengths from \(k\
Megan Cream, Ronald J. Gould
openaire   +3 more sources