Results 21 to 30 of about 59,758 (255)
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 Cartesian Products of Signed Graphs [PDF]
Discrete Applied Mathematics, 2020 In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main results is the unicity of the prime factor decomposition of signed graphs.
openaire +2 more sources
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
Game Chromatic Number of Cartesian Product Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 The game chromatic number $\chi _{g}$ is considered for the Cartesian product $G\,\square \,H$ of two graphs $G$ and $H$. Exact values of $\chi _{g}(K_2\square H)$ are determined when $H$ is a path, a cycle, or a complete graph. By using a newly introduced "game of combinations" we show that the game chromatic number is not bounded in the class of ...
Bartnicki, T. +5 more
openaire +4 more sources
Geodesic bipancyclicity of the Cartesian product of graphs
Theory and Applications of Graphs, 2022 A cycle containing a shortest path between two vertices $u$ and $v$ in a graph $G$ is called a $(u,v)$-geodesic cycle. A connected graph $G$ is geodesic 2-bipancyclic, if every pair of vertices $u,v$ of it is contained in a $(u,v)$-geodesic cycle of ...
Amruta Shinde, Y.M. Borse
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
Distinguishing Cartesian products of countable graphs
Discussiones Mathematicae Graph Theory, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Estaji Ehsan +4 more
openaire +2 more sources
Distance magic Cartesian product of graphs
Discussiones Mathematicae Graph Theory, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cichacz Sylwia +3 more
openaire +3 more sources