Results 1 to 10 of about 408,641 (276)
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
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
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
Counting Arithmetical Structures on Paths and Cycles [PDF]
Discrete Mathematics, 2018 Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vectors d, r such that (diag (d) - A) r=0 , where A is the adjacency matrix of G.
Braun, Benjamin +8 more
core +7 more sources
Finding $k$ Simple Shortest Paths and Cycles [PDF]
, 2016 The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair,
Agarwal, Udit, Ramachandran, Vijaya
core +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
Broadcasting on paths and cycles
Discrete Mathematics, 2022 arXiv admin note: text overlap with arXiv:2003 ...
Reaz Huq, Paweł Prałat
openaire +2 more sources
Characterization of signed paths and cycles admitting minus dominating function [PDF]
Communications in Combinatorics and Optimization, 2020 Let $G=(V,E,\sigma)$ be a finite signed graph. A function $f: V \rightarrow\{-1,0,1\}$ is a minus dominating function (MDF) of $ G $ if $f(u)+\sum_{v \in N(u)} \sigma (uv)f(v)\geq 1 $ for all $ u\in V $. In this paper we characterize signed paths and
S.R. Shreyas, M. Joseph
doaj +1 more source