Results 1 to 10 of about 473,067 (264)
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 +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.
I. G. Yero
semanticscholar +3 more sources
Gromov Hyperbolicity in Strong Product Graphs [PDF]
The Electronic Journal of Combinatorics, 2013 If X is a geodesic metric space and $x_1,x_2,x_3\in X$, a geodesic triangle $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$.
W. Carballosa +3 more
semanticscholar +5 more sources
Bounding the Open k-Monopoly Number of Strong Product Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G = (V, E) be a simple graph without isolated vertices and minimum degree δ, and let k ∈ {1 − ⌈δ/2⌉, . . . , ⌊δ/2⌋} be an integer. Given a set M ⊂ V, a vertex v of G is said to be k-controlled by M if δM(v)≥δG(v)2+k$\delta _M (v) \ge {{\delta _G (v)}
Kuziak Dorota +2 more
doaj +2 more sources
The Local Metric Dimension of Strong Product Graphs [PDF]
Graphs and Combinatorics, 2015 A vertex $$v\in V(G)$$v∈V(G) is said to distinguish two vertices $$x,y\in V(G)$$x,y∈V(G) of a nontrivial connected graph G if the distance from v to x is different from the distance from v to y.
Gabriel A. Barragán-Ramírez +1 more
semanticscholar +6 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
Computing FGZ Index of Sum Graphs under Strong Product
Journal of Mathematics, 2021 Topological index (TI) is a function that assigns a numeric value to a (molecular) graph that predicts its various physical and structural properties. In this paper, we study the sum graphs (S-sum, R-sum, Q-sum and T-sum) using the subdivision related ...
Zhi-Ba Peng +3 more
doaj +2 more sources
The partition dimension of strong product graphs and Cartesian product graphs
Discrete Mathematics, 2014 15 ...
I. G. Yero +3 more
semanticscholar +4 more sources
Strong Edge Coloring of Cayley Graphs and Some Product Graphs [PDF]
Graphs and Combinatorics, 2021 A strong edge coloring of a graph G is a proper edge coloring of G such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index.
Suresh Dara +3 more
semanticscholar +4 more sources
Toll number of the strong product of graphs [PDF]
Discrete Mathematics, 2018 A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$.
Tanja Gologranc, Polona Repolusk
semanticscholar +5 more sources