Results 1 to 10 of about 2,463 (224)
Molecules, 2018 The Cartesian product and join are two classical operations in graphs. Let dL(G)(e) be the degree of a vertex e in line graph L(G) of a graph G. The edge versions of atom-bond connectivity (ABCe) and geometric arithmetic (GAe) indices of G are defined as
Xiujun Zhang +3 more
doaj +3 more sources
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
On the power domination number of the Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 We give a brief survey about the existing results on the power domination of the Cartesian product of graphs, and improve two of the results by determining the exact power domination numbers of two families of graphs, namely, the cylinder Pn□Cmand the ...
K.M. Koh, K.W. Soh
doaj +2 more sources
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
An improvement in the two-packing bound related to Vizing's conjecture
Theory and Applications of Graphs, 2020 Vizing's conjecture states that the domination number of the Cartesian product of graphs is at least the product of the domination numbers of the two factor graphs.
Kimber Wolff
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
Cartesian product of hypergraphs: properties and algorithms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +2 more
doaj +1 more source
The generalized 3-connectivity of Cartesian product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +1 more source
Various Product on Multi Fuzzy Graphs
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 +1 more source
Formulas for the Number of Weak Homomorphisms from Paths to Ladder Graphs and Stacked Prism Graphs
Journal of Mathematics, 2023 Let G and H be graphs. A mapping f from VG to VH is called a weak homomorphism from G to H if fx=fy or fx,fy∈EH whenever x,y∈EG. A ladder graph is the Cartesian product of two paths, where one of the paths has only one edge.
Hatairat Yingtaweesittikul +2 more
doaj +1 more source