Results 11 to 20 of about 96,278 (280)
On the strong metric dimension of corona product graphs and join graphs [PDF]
Discrete Applied Mathematics, 2013 Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving set for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $W$.
Dorota Kuziak +2 more
exaly +7 more sources
Fork-decomposition of strong product of graphs [PDF]
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 +3 more sources
Strong Edge Coloring of Cayley Graphs and Some Product Graphs [PDF]
Graphs and Combinatorics, 2022 AbstractA 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. In this paper we determine the exact value of the strong chromatic index of all unitary Cayley graphs.
Suresh Dara 0002 +3 more
openaire +4 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$. The space $X$ is $\delta$-hyperbolic $($in the Gromov sense$)$ if any side of $T$ is contained in a $\delta$-neighborhood of the union of the two other sides, for every ...
Walter Carballosa +3 more
openaire +7 more sources
Bounding the Open k-Monopoly Number of Strong Product Graphs [PDF]
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 +4 more sources
Weak reconstruction of strong product graphs [PDF]
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blaz Zmazek, Janez Zerovnik
openaire +3 more sources
Computing FGZ Index of Sum Graphs under Strong Product [PDF]
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
Various Product on Multi Fuzzy Graphs [PDF]
Ratio Mathematica, 2022 In this paper, the definition of complement of multi fuzzy graph, direct sum of two multi fuzzy graphs are given and derived some theorems related to them.
R Muthuraj, K Krithika, S Revathi
doaj +3 more sources
On global (strong) defensive alliances in some product graphs [PDF]
Communications in Combinatorics and Optimization, 2017 A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one more neighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The
Ismael Gonz\'alez Yero +2 more
doaj +2 more sources
The geodetic number of strong product graphs [PDF]
Discussiones Mathematicae Graph Theory, 2010 For two vertices u and v of a connected graph G, the set IG[u; v] consists of all those vertices lying on u v geodesics in G. Given a set S of vertices of G, the union of all sets IG[u; v] for u; v 2 S is denoted by IG[S]. A set S V (G) is a geodetic set if IG[S] = V (G) and the minimum cardinality of a geodetic set is its geodetic number g(G) of G ...
A. P. Santhakumaran +1 more
openaire +2 more sources