Results 31 to 40 of about 3,558 (256)
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
The Cartesian product of graphs with loops
Ars Mathematica Contemporanea, 2015 We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one unlooped vertex. We also prove that this factorization can be computed in O(m) time, where m is the number
Tetiana Boiko +4 more
openaire +4 more sources
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +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
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
Generalized 3-edge-connectivity of Cartesian product graphs [PDF]
, 2015 summary:The generalized $k$-connectivity $\kappa _{k}(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al.
Sun, Yuefang
core +1 more source
Hadwiger Number and the Cartesian Product of Graphs [PDF]
Graphs and Combinatorics, 2008 The Hadwiger number mr(G) of a graph G is the largest integer n for which the complete graph K_n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, mr(G) >= chi(G), where chi(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product G [] H of graphs.
Chandran, L Sunil +2 more
openaire +2 more sources
Cartesian product of two picture fuzzy hypersoft graphs. [PDF]
, 2023 Cartesian product of two picture fuzzy hypersoft graphs.
Ibrahim Mekawy (14755646) +3 more
core +1 more source
On the Metric Dimension of Cartesian Products of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2007 A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. This paper studies the metric dimension of cartesian products G*H.
José Cáceres +6 more
openaire +3 more sources
GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
Ural Mathematical Journal, 2023 A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that ...
I Nengah Suparta +3 more
doaj +1 more source