Results 21 to 30 of about 473,067 (264)
On well-dominated direct, Cartesian and strong product graphs [PDF]
Discrete Mathematics, 2021 If each minimal dominating set in a graph is a minimum dominating set, then the graph is called well-dominated. Since the seminal paper on well-dominated graphs appeared in 1988, the structure of well-dominated graphs from several restricted classes have
Douglas F. Rall
semanticscholar +1 more source
The hull number of strong product graphs
Discussiones Mathematicae Graph Theory, 2011 A. Santhakumaran, S. Chandran
semanticscholar +2 more sources
Connectivity of Strong Products of Graphs [PDF]
Graphs and Combinatorics, 2010 The strong product of graphs is one of the three commutative and associative graph products. Let \(S\) be the strong product of two given graphs. The author proves that every minimum separating set in \(S\) is either an \(I\)-set or an \(L\)-set in \(S\).
Ladinek, Irena Hrastnik, Spacapan, Simon
openaire +6 more sources
Fork-decomposition of strong product of graphs
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 +1 more source
Operations on Neutrosophic Vague Soft Graphs [PDF]
Neutrosophic Sets and Systems, 2022 This article concerns with the neutrosophic vague soft graphs for treating neutrosophic vague soft information by employing the theory of neutrosophic vague soft sets with graphs.
S. Satham Hussain +3 more
doaj +1 more source
Zero-sum flow number of categorical and strong product of graphs [PDF]
Transactions on Combinatorics, 2020 A zero-sum flow is an assignment of nonzero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum $k$-flow if the absolute values of edges are less than $k$. We define the zero-sum
Muhammad Aamer Rashid +4 more
doaj +1 more source
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
Estimation of Laplacian spectra of direct and strong product graphs [PDF]
Discrete Applied Mathematics, 2015 Calculating a product of multiple graphs has been studied in mathematics, engineering, computer science, and more recently in network science, particularly in the context of multilayer networks. One of the important questions to be addressed in this area
Hiroki Sayama
semanticscholar +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