Results 11 to 20 of about 5,134,655 (243)
Infinite lexicographic products [PDF]
20 pages, 3 ...
Meir, Nadav
openaire +3 more sources
Nonrepetitive colorings of lexicographic product of graphs [PDF]
Special issue PRIMA ...
Balázs Keszegh +2 more
doaj +5 more sources
The generalized 3-connectivity of Lexicographic product graphs [PDF]
Graph ...
Xueliang Li, Yaping Mao
doaj +6 more sources
From Italian domination in lexicographic product graphs to w-domination in graphs [PDF]
In this paper, we show that the Italian domination number of every lexicographic product graph $G\circ H$ can be expressed in terms of five different domination parameters of $G$.
Abel Cabrera Martínez +2 more
openalex +3 more sources
Stable Locating-Dominating Sets in the Edge Corona and Lexicographic Product of Graphs
A set S ⊆ V (G) of an undirected graph G is a locating-dominating set of G if for each v ∈ V (G) \ S, there exists w ∈ S such tha vw ∈ E(G) and NG(x) ∩ S ̸= NG(y) ∩ S for any two distinct vertices x and y in V (G) \ S.
Gina Malacas, Sergio Canoy, Emmy Chacon
openalex +3 more sources
Lexicographic product graphs are antimagic
A graph with edges is called if its edges can be labeled with 1, 2, , such that the sums of the labels on the edges incident to each vertex are distinct. Hartsfield and Ringel conjectured that every connected graph other than is antimagic. In this paper,
Wenhui Ma +3 more
doaj +3 more sources
Pseudo MV-algebras and lexicographic product [PDF]
arXiv admin note: text overlap with arXiv:1304 ...
Dvurečenskij, Anatolij
openaire +4 more sources
Radio Labelings of Lexicographic Product of Some Graphs
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
On strong geodeticity in the lexicographic product of graphs
The strong geodetic number of a graph and its edge counterpart are recent variations of the pioneering geodetic number problem. Covering every vertex and edge of $ G $, respectively, using a minimum number of vertices and the geodesics connecting them ...
S. Gajavalli, A. Berin Greeni
doaj +2 more sources
Infinite Lexicographic Products of Triangular Algebras [PDF]
Some new connections are given between linear orderings and triangular operator algebras. A lexicograhic product is defined for triangular operator algebras and the Jacobson radical of an infinite lexicographic product of upper triangular matrix algebras is determined.
S. C. Power
openalex +5 more sources

