Results 1 to 10 of about 96,278 (280)
The Subset-Strong Product of Graphs [PDF]
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 +5 more sources
The partition dimension of strong product graphs and Cartesian product graphs [PDF]
Discrete Mathematics, 2014 15 ...
Dorota Kuziak +2 more
exaly +5 more sources
Spectrum and Ricci Curvature on the Weighted Strong Product Graphs
IEEE Access, 2023 The strong product on graphs is also called the normal product or the AND product. It is the union of Cartesian product and tensor product, and also is a binary operation on graphs. This operation takes two graphs and produces a new graph. In this paper,
Xiaoxiao Zhang, Zenghui Fang
doaj +3 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
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
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
Toll number of the strong product of graphs [PDF]
Discrete Mathematics, 2019 arXiv admin note: text overlap with arXiv:1608 ...
Tanja Dravec
exaly +4 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
On average connectivity of the strong product of graphs
Discrete Applied Mathematics, 2013 Generalitat de Cataluña 1298 ...
Encarnacion Abajo +2 more
exaly +5 more sources
Strong geodetic cores and Cartesian product graphs [PDF]
Applied Mathematics and Computation, 2019 19 pages, 4 ...
Vesna Irsic, Sandi Klavžar
exaly +4 more sources