Results 1 to 10 of about 544,613 (134)
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
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
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
Spectrum and Ricci Curvature on the Weighted Strong Product Graphs
IEEE Access, 2023 The strong product on graphs is also called the normal product or the AND product. It is the union of Cartesian product and tensor product, and also is a binary operation on graphs. This operation takes two graphs and produces a new graph. In this paper,
Xiaoxiao Zhang, Zenghui Fang
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
Computing FGZ Index of Sum Graphs under Strong Product
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 +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
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
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms [PDF]
, 2013 It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time.
Hellmuth, Marc +2 more
core +1 more source