Results 1 to 10 of about 5,793,190 (230)
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 +4 more sources
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
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 +4 more sources
The Spectrum of Weighted Lexicographic Product on Self-Complementary Graphs
IEEE Access, 2023 The lexicographic product, a powerful binary operation in graph theory, offers methods for creating a novel graph by establishing connections between each vertex of one graph and every vertex of another.
Xiaoxiao Zhang, Zenghui Fang
doaj +2 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
Radio Labelings of Lexicographic Product of Some Graphs
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
Double domination in lexicographic product graphs [PDF]
Discrete Applied Mathematics, 2020 In a graph G , a vertex dominates itself and its neighbours. A subset S ⊆ V ( G ) is said to be a double dominating set of G if S dominates every vertex of G at least twice.
Abel Cabrera Martinez +2 more
exaly +2 more sources
Computing Correlation among the Graphs under Lexicographic Product via Zagreb Indices
Journal of Chemistry, 2021 A topological index (TI) is a numerical descriptor of a molecule structure or graph that predicts its different physical, biological, and chemical properties in a theoretical way avoiding the difficult and costly procedures of chemical labs.
Muhammad Javaid +3 more
doaj +2 more sources
Total Roman domination in the lexicographic product of graphs
Discrete Applied Mathematics, 2019 A total Roman dominating function of a graph G = ( V , E ) is a function f : V ( G ) → { 0 , 1 , 2 } such that for every vertex v with f ( v ) = 0 there exists a vertex u adjacent to v with f ( u ) = 2 , and such that the subgraph induced by the set of ...
Dorota Kuziak
exaly +2 more sources
Operations on Neutrosophic Vague Soft Graphs [PDF]
Neutrosophic Sets and Systems, 2022 This article concerns with the neutrosophic vague soft graphs for treating neutrosophic vague soft information by employing the theory of neutrosophic vague soft sets with graphs.
S. Satham Hussain +3 more
doaj +1 more source