Results 1 to 10 of about 108,550 (161)
On alpha labeling of tensor product of paths and cycles [PDF]
Heliyon, 2023 In this article, we find an α-valuation for disjoint union of some bipartite graphs and the tensor product of paths and even cycles.
Uma L, Rajasekaran G
exaly +4 more sources
Embedding complete multi-partite graphs into Cartesian product of paths and cycles [PDF]
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 +2 more sources
L(2,1)-Labeling of the Strong Product of Paths and Cycles [PDF]
The Scientific World Journal, 2014 An L(2,1)-labeling of a graph G=(V,E) is a function f from the vertex set V(G) to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two and the labels on vertices at distance two differ by at least one. The span
Zehui Shao, Aleksander Vesel
doaj +2 more sources
Computing paths and cycles in biological interaction graphs [PDF]
BMC Bioinformatics, 2009 Background Interaction graphs (signed directed graphs) provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects
von Kamp Axel, Klamt Steffen
doaj +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 +2 more sources
On size multipartite Ramsey numbers for stars versus paths and cycles
Electronic Journal of Graph Theory and Applications, 2017 Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the size multipartite Ramsey number $m_j(G_1,G_2)$ is the ...
Anie Lusiani +2 more
doaj +2 more sources
Mutual-Visibility Sets in Cartesian Products of Paths and Cycles [PDF]
Results in Mathematics, 2023 For a given graph G, the mutual-visibility problem asks for the largest set of vertices M⊆V(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs ...
D. Korže, Aleksander Vesel
semanticscholar +1 more source
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We study the computational complexity of $c$-Colored $P_\ell$ Deletion and $c$-Colored $C_\ell$ Deletion. In these problems, one is given a $c$-edge-colored graph and wants to destroy all induced $c$-colored paths or cycles, respectively, on $\ell ...
Nils Jakob Eckstein +3 more
doaj +1 more source
Properly colored paths and cycles
Discrete Applied Mathematics, 2011 Shinya Fujita, Colton Magnant
exaly +2 more sources
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +1 more source