Results 21 to 30 of about 544,762 (274)
Strong geodetic problem on Cartesian products of graphs [PDF]
, 2017 The strong geodetic problem is a recent variation of the geodetic problem. For a graph $G$, its strong geodetic number ${\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that each vertex of $G$ lies on a fixed shortest path between a ...
Iršič, Vesna, Klavžar, Sandi
core +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 +1 more source
Strong products of Kneser graphs
Discrete Mathematics, 1994 For a (simple, undirected) graph \(G = (V(G), E(G))\), let \(\chi(G)\) and \(\omega(G)\) denote the chromatic number and the clique number, respectively. A subgraph \(H\) of \(G\) is a retract of \(G\) iff there is an edge-preserving map \(h : V(G) \to V(H)\) with \(h(x) = x\) for all \(x \in V(H)\).
Klavžar, Sandi, Milutinović, Uroš
openaire +1 more source
Fractional strong matching preclusion of some Cartesian product graphs
Journal of Physics: Conference Series, 2021 Abstract The fractional strong matching preclusion number of a graph is the minimum number of edges and vertices whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the fractional strong matching preclusion number for the Cartesian product of a graph and a cycle.
Bo Zhu, Shumin Zhang, Chenfu Ye
openaire +2 more sources
Superconnectivity of Networks Modeled by the Strong Product of Graphs [PDF]
, 2015 Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, using graph terminology, we first give a lower bound for the vertex connectivity of the strong product of two networks and then we ...
Cera López, Martín +3 more
core +1 more source
Strong products ofϰ-critical graphs [PDF]
Aequationes Mathematicae, 1993 LetG[H] be the lexicographic product and letG ⊠H be the strong product of the graphsG andH. It is proved that, ifG is aϰ-critical graph, then, for any graphH, $$\chi (G[H]) \leqslant \chi (H)(\chi (G) - 1) + \left[ {\frac{{\chi (H)}}{{\alpha (G)}}} \right ...
openaire +1 more source
On bounds for topological descriptors of φ-sum graphs
Journal of Taibah University for Science, 2020 The properties of chemical compounds are very important for the studies of the non-isomorphism phenomenon's related to the molecular graphs. Topological indices (TIs) are one of the mathematical tools which are used to study these properties.
Yu-Ming Chu +3 more
doaj +1 more source
The Local Metric Dimension of Strong Product Graphs [PDF]
Graphs and Combinatorics, 2015 A vertex $v\in V(G)$ is said to distinguish two vertices $x,y\in V(G)$ of a nontrivial connected graph $G$ if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\subset V(G)$ is a local metric generator for $G$ if every two adjacent vertices of $G$ are distinguished by some vertex of $S$.
Barragán-Ramírez, Gabriel A. +1 more
openaire +3 more sources
Some Applications of Strong Product [PDF]
Mathematics Interdisciplinary Research, 2018 Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent ...
Mostafa Tavakoli +2 more
doaj +1 more source
(Di)graph products, labelings and related results [PDF]
, 2017 Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them.
López Masip, Susana-Clara
core +4 more sources