Results 21 to 30 of about 408,641 (276)
Contracting Bipartite Graphs to Paths and Cycles [PDF]
Electronic Notes in Discrete Mathematics, 2017 9 pages, 2 ...
Konrad K. Dabrowski, Daniël Paulusma
openaire +6 more sources
Connected domination game played on Cartesian products
Open Mathematics, 2019 The connected domination game on a graph G is played by Dominator and Staller according to the rules of the standard domination game with the additional requirement that at each stage of the game the selected vertices induce a connected subgraph of G. If
Bujtás Csilla +3 more
doaj +1 more source
Decomposition of hypercube graphs into paths and cycles of length four
AKCE International Journal of Graphs and Combinatorics, 2022 By a [Formula: see text]-decomposition of a graph G, we mean a partition of the edge set of G into p paths of length 4 and q cycles of length 4. In this paper, we give conditions for a [Formula: see text]-decomposition of the n-dimensional hypercube ...
D. Saranya, S. Jeevadoss
doaj +1 more source
On the radio number for corona of paths and cycles
AKCE International Journal of Graphs and Combinatorics, 2020 Radio -coloring of graphs is one of the variations of frequency assignment problem. For a simple connected graph and a positive integer , a radio -coloring is an assignment of positive integers (colors) to the vertices of such that for every pair of ...
Niranjan P.K., Srinivasa Rao Kola
doaj +1 more source
Cycles and transitivity by monochromatic paths in arc-coloured digraphs
AKCE International Journal of Graphs and Combinatorics, 2015 A digraph D is an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a∈A(D), then colour(a) will denote the colour has been used on a.
Enrique Casas-Bautista +2 more
doaj +1 more source
Embedding complete multi-partite graphs into Cartesian product of paths and cycles
Electronic Journal of Graph Theory and Applications, 2021 Graph embedding is a powerful method in parallel computing that maps a guest network G into a host network H. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion, and the wirelength.
R. Sundara Rajan +4 more
doaj +1 more source
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
Discussiones Mathematicae Graph Theory, 2021 Thomassen, [Edge-disjoint Hamiltonian paths and cycles in tournaments, J. Combin. Theory Ser. B 28 (1980) 142–163] proved that every strong tournament has a pair of arc-disjoint Hamiltonian paths with distinct initial vertices and distinct terminal ...
Meng Wei
doaj +1 more source
Sensors, 2021 Due to the appearance of smart textiles and wearable electronics, the need for electro-conductive textiles and electro-conductive paths on textiles has become clear.
Agnieszka Tabaczyńska +2 more
doaj +1 more source
Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts [PDF]
, 2015 We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the augmented network. Unlike in the discrete setting where a shortcut connects
De Carufel, Jean-Lou +3 more
core +2 more sources
On H-Supermagic Labelings of m-Shadow of Paths and Cycles
International Journal of Mathematics and Mathematical Sciences, 2019 A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the sum of ...
Ika Hesti Agustin +5 more
doaj +1 more source