Results 11 to 20 of about 100,234 (286)
Various Product on Multi Fuzzy Graphs [PDF]
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 +2 more sources
On edge product cordial graphs [PDF]
Opuscula Mathematica, 2019 An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling.
Jaroslav Ivančo
doaj +2 more sources
Roman domination in direct product graphs and rooted product graphs [PDF]
AIMS Mathematics, 2021 <abstract><p>Let $ G $ be a graph with vertex set $ V(G) $. A function $ f:V(G)\rightarrow \{0, 1, 2\} $ is a Roman dominating function on $ G $ if every vertex $ v\in V(G) $ for which $ f(v) = 0 $ is adjacent to at least one vertex $ u\in V(G) $ such that $ f(u) = 2 $. The Roman domination number of $ G $ is the minimum weight $ \omega(f) =
Cabrera Martínez, Abel +2 more
openaire +7 more sources
ON PLANARITY OF DIRECT PRODUCT OF MULTIPARTITE COMPLETE GRAPHS [PDF]
Discrete Mathematics, Algorithms and Applications, 2009 The planarity of the direct product of two graphs has been widely studied in the past. Surprisingly, the missing part is the product with K2, which seems to be less predictible. In this piece of work, we characterize which subdivisions of multipartite complete graphs, have their direct product with K2 planar.
Beaudou, Laurent +3 more
openaire +4 more sources
Journal of MathematicsSymmetry properties are of vital importance for graphs. The famous Cayley graph is a good mathematical model as its high symmetry. The normality of the graph can well reflect the symmetry of the graph.
Li Wang, Xiaohan Ye, Weihua Yang
doaj +2 more sources
A Heuristic for Direct Product Graph Decomposition [PDF]
Journal of Graph Algorithms and Applications, 2023 In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph $G$ with adjacency matrix $\mathbf{Adj}(G)$, our heuristic aims at identifying two graphs $G_1$ and $G_2$ such that $G = G_1 \times G_2$, where $G_1
Luca Calderoni +2 more
openaire +5 more sources
Dominating direct products of graphs
Discrete Mathematics, 2007 Let \(G=(V,E)\) be a graph. A set \(S\subset V\) is called dominating if each vertex in \(V\backslash S\) is adjacent to at least one vertex in \(S\). The domination number \(\gamma(G)\) of a graph \(G\) is the minimum cardinality of a dominating set. For graphs \(G\) and \(H\), the direct product \(G\times H\) is the graph with vertex set \(V(G)\times
Bostjan Bresar +2 more
openaire +4 more sources
Direct product of automorphism groups of colored graphs
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mariusz Grech, Andrzej Kisielewicz
exaly +3 more sources
Direct product and uniqueness of automorphism groups of graphs
Discrete Mathematics, 1999 The author considers the problem of representing permutation groups by graphs. If \(\Aut(G)\) denotes the automorphism group of a graph \(G\) and \(A\equiv\Aut(G)\), then \(A\) is a representable permutation group. If \(A\) is represented by exactly one graph \(G\) (up to isomorphism), then \(A\) is called unique.
exaly +2 more sources
Bounds on the Twin-Width of Product Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomass\'{e} & Watrigant. Given two graphs $G$ and $H$ and a graph product $\star$, we address the question: is the twin-width of $G\star H$ bounded by a function of the twin ...
William Pettersson, John Sylvester
doaj +1 more source