Results 11 to 20 of about 549,593 (301)
Fork-decomposition of strong product of graphs
Ratio Mathematica, 2023 Decomposition of arbitrary graphs into subgraphs of small size is assuming importance in the literature. There are several studies on the isomorphic decomposition of graphs into paths, cycles, trees, stars, sunlet etc.
Samuel Issacraj, Paulraj Joseph
doaj +2 more sources
Wiener index of strong product of graphs [PDF]
Opuscula Mathematica, 2018 The Wiener index of a connected graph \(G\) is the sum of distances between all pairs of vertices of \(G\). The strong product is one of the four most investigated graph products.
Iztok Peterin, Petra Žigert Pleteršek
doaj +4 more sources
NZ‐flows in strong products of graphs
Journal of Graph Theory, 2009 AbstractWe prove that the strong product G1⊠ G2 of G1 and G2 is ℤ3‐flow contractible if and only if G1⊠ G2 is not T⊠ K2, where T is a tree (we call T⊠ K2 a K4‐tree). It follows that G1⊠ G2 admits an NZ 3 ‐flow unless G1⊠ G2 is a K4 ‐tree. We also give a constructive proof that yields a polynomial algorithm whose output is an NZ 3‐flow if G1⊠ G2 is not ...
Wilfried Imrich +3 more
openalex +5 more sources
Roman domination in Cartesian product graphs and strong product graphs [PDF]
Applicable Analysis and Discrete Mathematics, 2013 A map f : V ? {0, 1, 2} is a Roman dominating function for G if for every vertex v with f(v) = 0, there exists a vertex u, adjacent to v, with f(u) = 2. The weight of a Roman dominating function is f(V ) = ?u?v f(u). The minimum weight of a Roman dominating function on G is the Roman domination number of G.
Yero, Ismael G. +1 more
openaire +4 more sources
F index of graphs based on four new operations related to the strong product [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph.
D. Sarala +3 more
doaj +2 more sources
The Menger number of the strong product of graphs [PDF]
, 2013 The xy-Menger number with respect to a given integer ℓ, for every two vertices x, y in a connected graph G, denoted by ζℓ(x, y), is the maximum number of internally disjoint xy-paths whose lengths are at most ℓ in G. The Menger number of G with respect
Abajo Casado, María Encarnación +3 more
core +3 more sources
Extra Connectivity of Strong Product of Graphs [PDF]
, 2023 The $g$-$extra$ $connectivity$ $κ_{g}(G)$ of a connected graph $G$ is the minimum cardinality of a set of vertices, if it exists, whose deletion makes $G$ disconnected and leaves each remaining component with more than $g$ vertices, where $g$ is a non-negative integer.
Qinze Zhu, Yingzhi Tian
openalex +3 more sources
The partition dimension of strong product graphs and Cartesian product graphs
Discrete Mathematics, 2014 15 ...
Ismael González Yero +3 more
openaire +5 more sources
Strong resolving partitions for strong product graphs and Cartesian product graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Strong geodetic cores and Cartesian product graphs [PDF]
Applied Mathematics and Computation, 2018 19 pages, 4 ...
Valentin Gledel +2 more
openalex +4 more sources