Results 1 to 10 of about 395,936 (323)
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
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
Existence of dominating cycles and paths
Discrete Mathematics, 1983 AbstractA cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident with at least one vertex of C. A D-path is defined analogously. If a graph G contains a D-cycle (D-path), then its edge graph L(G) has a hamiltonian cycle (hamiltonian path). Necessary conditions and sufficient conditions are obtained for graphs to have a
H.J. Veldman
openalex +4 more sources
Optimal gossiping in paths and cycles
Journal of Discrete Algorithms, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francis C. M. Lau, Songyang Zhang
openalex +5 more sources
On paths and cycles dominating hypercubes
Discrete Mathematics, 2003 Let \(\text{c}_n\), \(\text{p}_n\) and \(\text{cyc}_n\) denote the minimum number of vertices in a dominating set, a dominating path and a dominating cylce of the \(n\)-dimensional hypercube, respectively. The authors prove that \(\text{cyc}_n \leq 2^{m-p}(2^k+2)\) for \(p\geq 2\), \(m=2^p-1\), \(1\leq k\leq 2^p\) and \(n=m+k\), \(\text{c}_n\geq 2 ...
Tomáš Dvořák +2 more
openalex +3 more sources
On the resolution of path ideals of cycles [PDF]
Communications in Algebra, 2013 We give a formula to compute all the top degree graded Betti numbers of the path ideal of a cycle. Also we will find a criterion to determine when Betti numbers of this ideal are non zero and give a formula to compute its projective dimension and regularity.
Ali Alilooee, Sara Faridi
openalex +5 more sources
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
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
On \delta^(k)-colouring of Powers of Paths and Cycles
Theory and Applications of Graphs, 2021 In a proper vertex colouring of a graph, the vertices are coloured in such a way that no two adjacent vertices receive the same colour, whereas in an improper vertex colouring, adjacent vertices are permitted to receive same colours subjected to some ...
Merlin Ellumkalayil, Sudev Naduvath
doaj +1 more source