Results 281 to 290 of about 47,947 (303)
Some of the next articles are maybe not open access.
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
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 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
Gracefulness of replicated paths and cycles
Ars Comb., 1999The replicated graph of a graph can be obtained as follows: replace any vertex by a stable (independent) set of an arbitrary nonzero size and join these individual sets by complete bipartite graphs if the origin vertices were joined by an edge. It is shown that nontrivial replicated paths and some replicated cycles are graceful.
openaire +1 more source
The secure domination number of Cartesian products of small graphs with paths and cycles
Discrete Applied Mathematics, 2022Michael Haythorpe, Alex Newcombe
exaly
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
SIAM Journal on Discrete Mathematics, 2020Ran Gu, Jiaao Li, Yongtang Shi
exaly
The g-Extra Connectivity of the Strong Product of Paths and Cycles
Symmetry, 2022Yingzhi Tian, Tian Yingzhi
exaly