Results 1 to 10 of about 1,118,633 (161)
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
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.
Ismael G Yero
exaly +3 more sources
Erratum to “On the strong metric dimension of the strong products of graphs”
Open Mathematics, 2015 The original version of the article was published in Open Mathematics (formerly Central European Journal of Mathematics) 13 (2015) 64–74. Unfortunately, the original version of this article contains a mistake: in Lemma 2.17 appears that for any C1-graph ...
Kuziak Dorota +2 more
doaj +3 more sources
The Subset-Strong Product of Graphs
Annales Mathematicae SilesianaeIn this paper, we introduce the subset-strong product of graphs and give a method for calculating the adjacency spectrum of this product. In addition, exact expressions for the first and second Zagreb indices of the subset-strong products of two graphs ...
Eliasi Mehdi
doaj +3 more sources
On the strong metric dimension of the strong products of graphs
Open Mathematics, 2015 Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u.
Kuziak Dorota +2 more
doaj +3 more sources
On the strong metric dimension of product graphs
Electronic Notes in Discrete Mathematics, 2014 Abstract Let G be a connected graph. A vertex w ∈ V ( G ) strongly resolves two vertices u , v ∈ V ( G ) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by ...
Dorota Kuziak +2 more
exaly +2 more sources
Operations on Neutrosophic Vague Graphs [PDF]
Neutrosophic Sets and Systems, 2020 Neutrosophic graph is a mathematical tool to hold with imprecise and unspecified data. In this manuscript, the operations on neutrosophic vague graphs are introduced. Moreover, Cartesian product, lexicographic product, cross product, strong product and
S. Satham Hussain +3 more
doaj +1 more source
Connectivity of Strong Products of Graphs [PDF]
Graphs and Combinatorics, 2010 The strong product of graphs is one of the three commutative and associative graph products. Let \(S\) be the strong product of two given graphs. The author proves that every minimum separating set in \(S\) is either an \(I\)-set or an \(L\)-set in \(S\).
Ladinek, Irena Hrastnik, Spacapan, Simon
openaire +6 more sources
A digital Jordan surface theorem with respect to a graph connectedness
Open Mathematics, 2023 After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line Z{\mathbb{Z}} with a certain set of paths of length nn for every positive integer nn.
Šlapal Josef
doaj +1 more source
On the first and second Zagreb indices of some products of signed graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Some of the most comprehensively studied degree-based topological indices are the Zagreb indices. In this article, the pair of Zagreb indices have been determined for five product graphs namely tensor product, Cartesian product, lexicographic product ...
Shivani Rai, Biswajit Deb
doaj +1 more source