Results 121 to 130 of about 5,134,655 (243)

Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths

Indonesian Journal of Combinatorics, 2018
An edge magic total (EMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to a set of numbers defined by λ : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} with the property that for every xy ∈ E, the weight of xy equals to a constant k,
Inne Singgih
doaj   +1 more source

Distance k-Cost Effective Sets in the Corona and Lexicographic Product of Graphs

, 2023
Julius G. Caadan, Rolando N. Paluga, Imelda S. Aniversario   +2 more
openalex   +2 more sources

Cardinal functions on lexicographic products

Topology and its Applications
The authors consider lexicographic products of GO-spaces.
Hirata, Yasushi, Kemoto, Nobuyuki
openaire   +2 more sources

On local antimagic chromatic number of lexicographic product graphs

Acta Mathematica Hungarica, 2023
G. Lau, W. Shiu
semanticscholar   +1 more source

Closed formulae for the strong metric dimension of lexicographic product\n graphs [PDF]

, 2014
Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez‐Velázquez   +2 more
openalex   +1 more source

Retracted: Computing Correlation among the Graphs under Lexicographic Product via Zagreb Indices [PDF]

, 2023
Journal of Chemistry
openalex   +1 more source

A lexicographic product for signed graphs

, 2019
Summary: A signed graph is a pair \(\Gamma=(G,\sigma)\), where \(G=(V(G),E(G))\) is a graph and \(\sigma:E(G)\rightarrow\{+1,-1\}\) is the sign function on the edges of \(G\). The notion of composition (also known as lexicographic product) of two signed graphs \(\Gamma\) and \(\Lambda=(H,\tau)\) already exists in literature, yet it fails to map ...
Brunetti M, Cavaleri M, Donno A.
openaire   +2 more sources

Hamiltonian Decomposition of Lexicographic Products of Digraphs

Journal of Combinatorial Theory, Series B, 1998
We partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexicographic product of two hamiltonian decomposable digraphs, the first of odd order, is itself hamiltonian decomposable in general.
openaire   +1 more source

Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs

Discussiones Mathematicae Graph Theory, 2016
Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair
Kuziak Dorota, Yero Ismael G., Rodríguez-Velázquez Juan A.   +2 more
doaj   +1 more source

On $r$-dynamic coloring on lexicographic product of star graphs [PDF]

, 2021
C S Gomathi, N. Mohanapriya, Vernold Vivin J   +2 more
openalex   +1 more source