Results 281 to 290 of about 407,618 (322)
Some of the next articles are maybe not open access.
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
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, 2023A 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, 2007AbstractChemInform 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
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
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
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
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, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Jianfang, Lee, Tony T.
openaire +1 more source
Paths and cycles concerning independent edges
Graphs and Combinatorics, 1990A natural generalization of the concept of alternating path for a matching is that of an admissible path. An admissible path or cycle D in a graph G for a set L of pairwise independent edges is one in which, whenever \(e\in L\), D either contains e or touches no vertex of e.
openaire +2 more sources
Restricted Hamiltonian Paths and Cycles
2009In this chapter we discuss results on hamiltonian paths and cycles with special properties. We start by studying hamiltonian paths with one or more end-vertices prescribed, that is, we study paths which start in a given vertex, paths which connect two prescribed vertices and, finally, paths which start and end in specified vertices.
Jørgen Bang-Jensen, Gregory Z. Gutin
openaire +1 more source
Paths, Cycles, and Connectivity
2017In this chapter, we study some important fundamental concepts of graph theory. In Section 3.1 we start with the definitions of walks, trails, paths, and cycles. The well-known Eulerian graphs and Hamiltonian graphs are studied in Sections 3.2 and 3.3, respectively.
openaire +1 more source
Optimal Identifying Codes in Cycles and Paths
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Junnila, Ville, Laihonen, Tero
openaire +3 more sources