Results 11 to 20 of about 5,793,190 (230)
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +4 more sources
Infinite Lexicographic Products [PDF]
Annals of Pure and Applied Logic, 2019 We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times.
Meir, Nadav
core +2 more sources
Some diameter notions in lexicographic product
Electronic Journal of Graph Theory and Applications, 2018 Many graphs such as hypercubes, star graphs, pancake graphs, grid, torus etc are known to be good interconnection network topologies. In any network topology, the vertices represent the processors and the edges represent links between the processors. Two
Chithra MR +2 more
doaj +2 more sources
Lexicographic product graphs are antimagic
AKCE International Journal of Graphs and Combinatorics, 2018 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 +2 more sources
Operations on Neutrosophic Vague Graphs [PDF]
Neutrosophic Sets and Systems, 2020 Neutrosophic graph is a mathematical tool to hold with imprecise and unspecified data. In this manuscript, the operations on neutrosophic vague graphs are introduced. Moreover, Cartesian product, lexicographic product, cross product, strong product and
S. Satham Hussain +3 more
doaj +1 more source
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 +1 more source
Spanning Tree Packing of Lexicographic Product of Graphs Resulting from Path and Complete Graphs
Asian Research Journal of Mathematics, 2023 For any graphs G of order n, the spanning tree packing number, denoted by, of a graph G is the maximum number of edge disjoint spanning tree contained in G.
I. Jr.
semanticscholar +1 more source
Strong Resolving Domination in the Lexicographic Product of Graphs
European Journal of Pure and Applied Mathematics, 2023 Let G be a connected graph. A subset S ⊆ V (G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u, v ∈ V (G), there exists a vertex w ∈ S such that u ∈ IG[v, w] or IG[u, w].
Gerald B. Monsanto +2 more
semanticscholar +1 more source
Stable Locating-Dominating Sets in the Edge Corona and Lexicographic Product of Graphs
European Journal of Pure and Applied Mathematics, 2023 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 A. Malacas +2 more
semanticscholar +1 more source
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs [PDF]
Fundamenta Informaticae, 2021 The aim of this paper is to obtain closed formulas for the perfect domination number, the Roman domination number and the perfect Roman domination number of lexicographic product graphs.
Abel Cabrera Martínez +2 more
semanticscholar +1 more source