Results 31 to 40 of about 96,278 (280)
Wiener index of strong product of graphs [PDF]
Opuscula Mathematica, 2018 The Wiener index of a connected graph \(G\) is the sum of distances between all pairs of vertices of \(G\). The strong product is one of the four most investigated graph products.
Iztok Peterin, Petra Žigert Pleteršek
doaj +1 more source
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
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
Local strong rainbow connection number of corona product between cycle graphs
Indonesian Journal of Combinatorics, 2023 A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called ...
Khairunnisa N. Afifah, Kiki A. Sugeng
doaj +1 more source
Computing strong articulation points and strong bridges in large scale graphs [PDF]
, 2012 Let G = (V,E) be a directed graph. A vertex v ∈ V (respectively an edge e ∈ E) is a strong articulation point (respectively a strong bridge) if its removal increases the number of strongly connected components of G.
A. Orlandi +22 more
core +1 more source
Bounds on the Twin-Width of Product Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomass\'{e} & Watrigant. Given two graphs $G$ and $H$ and a graph product $\star$, we address the question: is the twin-width of $G\star H$ bounded by a function of the twin ...
William Pettersson, John Sylvester
doaj +1 more source
Retracts of strong products of graphs
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wilfried Imrich, Sandi Klavzar
openaire +1 more source
Hamiltonian Cycles in Strong Products of Graphs [PDF]
Canadian Mathematical Bulletin, 1979 Abstract. Let denote the graph (k times) where is the strong product of the two graphs G and H. In this paper we prove the conjecture of J. Zaks [3]: For every connected graph G with at least two vertices there exists an integer k = k(G) for which the graph is hamiltonian.
Bermond, J. C. +2 more
openaire +3 more sources
Independent strong domination number of indu-bala product of graphs [PDF]
, 2023 A set D⊂ V be the strong dominating set of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong domination number γst(G) of G is the minimum cardinality of a strong dominating set.
Priyadharshini M. +2 more
core +2 more sources
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