Results 1 to 10 of about 9,792 (167)
Nonrepetitive colorings of lexicographic product of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Special issue PRIMA ...
Balázs Keszegh +2 more
doaj +8 more sources
The generalized 3-connectivity of Lexicographic product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Xueliang Li, Yaping Mao
doaj +8 more sources
Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 In this paper, we study the weak Roman domination number and the secure domination number of lexicographic product graphs. In particular, we show that these two parameters coincide for almost all lexicographic product graphs. Furthermore, we obtain tight
Klein Douglas J. +1 more
doaj +3 more sources
Total Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 Given a graph G with vertex set V (G), a function f : V (G) → {0, 1, 2} is said to be a total dominating function if Σu∈N(v) f(u) > 0 for every v ∈ V (G), where N(v) denotes the open neighbourhood of v. Let Vi = {x ∈ V (G) : f(x) = i}. A total dominating
Martínez Abel Cabrera +1 more
doaj +3 more sources
Metric dimension of lexicographic product of some known graphs [PDF]
Journal of Mahani Mathematical Research, 2023 For an ordered set $W=\{w_1,w_2,\ldots,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),\ldots,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where $d(x,y ...
Mohsen Jannesari
doaj +4 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 +2 more sources
Radio Labelings of Lexicographic Product of Some Graphs [PDF]
Journal of Mathematics, 2021 Labeling of graphs has defined many variations in the literature, e.g., graceful, harmonious, and radio labeling. Secrecy of data in data sciences and in information technology is very necessary as well as the accuracy of data transmission and different ...
Muhammad Shahbaz Aasi +3 more
doaj +2 more sources
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 +2 more sources
Theoretical framework for a decision support system for micro-enterprise supermarket investment risk assessment using novel picture fuzzy hypersoft graph. [PDF]
PLoS ONE, 2023 Risk evaluation has always been of great interest for individuals wanting to invest in various businesses, especially in the marketing and product sale centres.
Muhammad Saeed +3 more
doaj +2 more sources
The generalized 3-edge-connectivity of lexicographic product graphs [PDF]
, 2014 The generalized $k$-edge-connectivity $\lambda_k(G)$ of a graph $G$ is a generalization of the concept of edge-connectivity. The lexicographic product of two graphs $G$ and $H$, denoted by $G\circ H$, is an important graph product.
B Barden +28 more
core +2 more sources