Results 191 to 200 of about 5,793,190 (230)

Total colorings of certain classes of lexicographic product graphs

Discret. Math. Algorithms Appl., 2021
A total coloring of a graph G is an assignment of colors to all the elements (vertices and edges) of the graph in such a way that no two adjacent or incident elements receive the same color.
T. Sandhiya, J. Geetha, K. Somasundaram
semanticscholar   +1 more source

The metric dimension of the lexicographic product of graphs

Discrete Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suhadi Wido Saputro, Rinovia Simanjuntak, H Assiyatun   +2 more
exaly   +3 more sources

The geodetic number of the lexicographic product of graphs

Discrete Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boštjan Brešar, Tadeja Kraner Sumenjak, Aleksandra Tepeh   +2 more
exaly   +4 more sources

Doubly Isolate Domination in Lexicographic Product of Graphs

International Journal of Mathematical and Computer Sciences
For given positive integers a, b, and c such that 2\leq a\leq b\leq c, we show that there exists a connected graph G such that \gamma(G)=a, \gamma_0(G)=b, and \gamma_{00}(G)=c where \gamma is a domination number and \gamma_0 is an isolate domination ...
Ronel Baluntang
semanticscholar   +1 more source

The weight of lexicographic products

Topology and its Applications, 2020
Let \(\gamma\) be an ordinal \(\geq 2\) and \(X_\alpha\) be a GO-space for ...
Hirata, Yasushi, Kemoto, Nobuyuki
openaire   +2 more sources

The equidistant dimension of graphs: NP-completeness and the case of lexicographic product graphs

AIMS Mathematics
Let $ V(G) $ be the vertex set of a simple and connected graph $ G $. A subset $ S\subseteq V(G) $ is a distance-equalizer set of $ G $ if, for every pair of vertices $ u, v\in V(G)\setminus S $, there exists a vertex in $ S $ that is equidistant to $ u $
Adrià Gispert-Fernández, J. A. Rodríguez-Velázquez   +1 more
semanticscholar   +1 more source

The reliability of lexicographic product digraphs

Applied Mathematics and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qinghai Liu, Yanmei Hong
openaire   +2 more sources

Diagnosability of the Lexicographic Product of Paths and Paths under PMC Model

2024 IEEE International Conference on Advanced Information, Mechanical Engineering, Robotics and Automation (AIMERA)
In a multiprocessor system, if the number of faulty processors is less than t, and the system can identify all faulty processors directly without any exchanging, then the system’s diagnosability is t.
Bu Chen, Feng Li
semanticscholar   +1 more source

On strong geodeticity in the lexicographic product of graphs

AIMS Mathematics
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
semanticscholar   +1 more source

Diagnosability of the lexicographic product of cycles and paths under PMC Model

International Congress on Information and Communication Technology
By increasing the number of processors and with the help of the large-scale interconnection networks built on processors, the advanced multiprocessor systems, obtain their superpower of computing.
Bu Chen, Feng Li
semanticscholar   +1 more source