Results 231 to 240 of about 408,641 (276)

Closures, cycles, and paths

Journal of Graph Theory, 2011
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u) + d(v)≥n for every pair of nonadjacent vertices u and v, then G is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have been obtained, so‐called “Ore‐type degree conditions”. In [R. J. Faudree, R. H. Schelp, A.
Harant, Jochen   +3 more
openaire   +2 more sources

Cycles and Paths Related Vertex-Equitable Graphs

Journal of Combinatorial Mathematics and Combinatorial Computing, 2023
A vertex labeling ξ of a graph χ is referred to as a ‘vertex equitable labeling (VEq.)’ if the induced edge weights, obtained by umming the labels of the end vertices, satisfy the following condition: the absolute difference in the number of vertices v and u with labels ξ(v)=a and ξ(u)=b (where a, b∈Z) is approximately 1, considering a given set A that
Saima Nazeer   +2 more
openaire   +2 more sources

Hamilton Cycles and Paths in Fullerenes

Journal of Chemical Information and Modeling, 2007
AbstractChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract, please click on HTML or PDF.
openaire   +2 more sources

Paths, Cycles, and Partitions

1991
Abstract Graphical models of exchange systems enable us to discover structural commonality beneath empirical diversity, and they provide for the coherent classification of structural forms. We begin with two analyses. First, we give a unitary definition of dual organization, a widely distributed and, it has been conjectured, archaic type
Per Hage, Frank Harary
openaire   +1 more source

Hamiltonian Paths and Cycles

2013
In this chapter, the concepts of Hamiltonian paths and Hamiltonian cycles are discussed. In the first section, the history of Hamiltonian graphs is described, and then some concepts such as Hamiltonian paths, Hamiltonian cycles, traceable graphs, and Hamiltonian graphs are defined.
Mahtab Hosseininia, Faraz Dadgostari
openaire   +1 more source

Paths and cycles of hypergraphs

Science in China Series A: Mathematics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Jianfang, Lee, Tony T.
openaire   +1 more source

Home - About - Disclaimer - Privacy