Results 231 to 240 of about 42,675 (259)
Some of the next articles are maybe not open access.
Algorithms to count paths and cycles
Information Processing Letters, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
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.
Jochen Harant +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.
Jochen Harant +3 more
openaire +2 more sources
Cycles and paths in multigraphs [PDF]
Australas. J Comb., 1992 Let \({\mathbf d}=(d_ 1,d_ 2,\dots,d_ n)\) be a sequence of \(n\) nonnegative integers. If there is a multigraph (without loops) \(G\) with vertex set \(\{v_ i:i=1,2,\dots,n\}\) such that the degree of \(v_ i\) is \(d_ i\) for \(i=1,2,\dots,n\), \({\mathbf d}\) will be called a degree sequence and we say that it has the realization \(G\). A realization
Roger B. Eggleton +2 more
openaire +1 more source
Journal of Graph Theory, 1978
AbstractLet k be a positive integer, and S a nonempty set of positive integers. Suppose that G is a connected graph containing a path of length k, and that each path P of length k in G is contained in some cycle C(P) of length s ∈ S. We prove that every path of length less than k can be extended to a path of length k in G.
openaire +2 more sources
AbstractLet k be a positive integer, and S a nonempty set of positive integers. Suppose that G is a connected graph containing a path of length k, and that each path P of length k in G is contained in some cycle C(P) of length s ∈ S. We prove that every path of length less than k can be extended to a path of length k in G.
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
1998
Traditional network location theory is concerned with the optimal location of facilities which can be considered as single points (emergency medical service stations, switching centers in communication networks, bus stops, mail boxes, etc.) However, in many real problems the facility to be located is too large to be modeled as a point. Examples of such
Labbé, Martine +2 more
openaire +2 more sources
Traditional network location theory is concerned with the optimal location of facilities which can be considered as single points (emergency medical service stations, switching centers in communication networks, bus stops, mail boxes, etc.) However, in many real problems the facility to be located is too large to be modeled as a point. Examples of such
Labbé, Martine +2 more
openaire +2 more sources
Simple Paths and Cycles Avoiding Forbidden Paths
2017A graph with forbidden paths is a pair (G, F) where G is a graph and F is a subset of the set of paths in G. A simple path avoiding forbidden paths in (G, F) is a simple path in G such that each subpath is not in F. It is shown in [S. Szeider, Finding paths in graphs avoiding forbidden transitions, DAM 126] that the problem of deciding the existence of
openaire +1 more source
On Hamiltonian cycles and Hamiltonian paths
Information Processing Letters, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Sohel Rahman, Mohammad Kaykobad
openaire +1 more source
On the observability of path and cycle graphs
49th IEEE Conference on Decision and Control (CDC), 2010In this paper we investigate the observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the
PARLANGELI, GIANFRANCO +1 more
openaire +1 more source
Gracefulness of the union of cycles and paths
Ars Comb., 1999It is shown that the union of a cycle and a path \(C(k)\cup P(n)\) is graceful for \(n\geq k+1\) (\(k\geq 3\)). Some particular cases are also investigated.
M. A. Seoud +2 more
openaire +1 more source