Results 21 to 30 of about 5,793,190 (230)
On the b-Continuity of the Lexicographic Product of Graphs [PDF]
Graphs and Combinatorics, 2017 A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of $G$ is the maximum integer $χ_b(G)$ for which $G$ has a b-coloring with $χ_b(G)$ colors.
Cláudia Linhares Sales +2 more
openaire +5 more sources
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2023 A wide range of parameters of domination in graphs can be defined and studied through a common approach that was recently introduced in [ https://doi.org/10.26493/1855-3974.2318.fb9 ] under the name of w -domination, where $$w=(w_0,w_1, \dots ,w_l)$$ w =
A. Cabrera-Martínez +2 more
semanticscholar +1 more source
Lexicographic palindromic products
The Art of Discrete and Applied Mathematics, 2022 Summary: A graph \(G\) on \(n\) vertices is \textit{palindromic} if there is a vertex-labeling bijection \(f : V(G) \rightarrow \{1, 2, \dots, n\}\) with the property that for any edge \(vw \in E(G)\), there is an edge \(xy \in E(G)\) for which \(f(x) = n - f(v) + 1\) and \(f(y) = n - f(w) + 1\).
openaire +2 more sources
Functorial equations for lexicographic products [PDF]
Proceedings of the American Mathematical Society, 2003 Summary: We generalize the main result of an earlier paper by the authors [Proc. Am. Math. Soc. 125, 3177-3183 (1997; Zbl 0888.12004)] concerning the convex embeddings of a chain \(\Gamma\) in a lexicographic power \(\Delta^{\Gamma}\). For a fixed non-empty chain \(\Delta\), we derive necessary and sufficient conditions for the existence of non-empty ...
Kuhlmann, Franz-Viktor +2 more
openaire +3 more sources
Quadripartitioned Neutrosophic Graph Structures [PDF]
Neutrosophic Sets and Systems, 2022 The quadripartitioned neutrosophic set is the partition of indeterminacy function of the neutrosophic set into contradiction part and ignorance part.
S. Satham Hussain +5 more
doaj +1 more source
Coupon coloring of lexicographic product of graphs
The Art of Discrete and Applied Mathematics, 2022 Summary: A \(k\)-coupon coloring of a graph \(G\) without isolated vertices is an assignment of colors from \([k]=\{1,2,\dots,k\}\) to the vertices of \(G\) such that the neighborhood of every vertex of \(G\) contains vertices of all colors from \([k]\).
Reji Thankachan, Pavithra Rajamani
semanticscholar +3 more sources
Graph Invariants of Deleted Lexicographic Product of Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 The deleted lexicographic product G[H]-nG of graphs G and H is a graph with vertex set V(G)×V(H) and u=(u1, v1) is adjacent with v=(u2, v2) whenever (u1=u2 and v1 is adjacent with v2) or (v1 ≠ v2 and u1 is adjacent with u2).
Bahare Akhavan Mahdavi +2 more
doaj +1 more source
Restrained 2-Resolving Sets in the Join, Corona and Lexicographic Product of Two Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions.
Jean Mansanadez Cabaro, Helen M. Rara
semanticscholar +1 more source
On 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions.
Jean Mansanadez Cabaro, Helen M. Rara
semanticscholar +1 more source
Game chromatic number of lexicographic product graphs
AKCE International Journal of Graphs and Combinatorics, 2015 In this paper, we determine the exact values of the game chromatic number of lexicographic product of path P2 with path Pn, star K1,n and wheel Wn. Also we give an upper bound for the game chromatic number of lexicographic product of any two simple ...
R. Alagammai, V. Vijayalakshmi
doaj +1 more source