Results 181 to 190 of about 1,343 (197)

A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product [PDF]

open access: yesDiscrete Mathematics, 2009
In 1960, Sabidussi conjectured that if a graph G is isomorphic to the lexicographic product G[G], then the wreath product of Aut(G) by itself is a proper subgroup of Aut(G[G]). A positive answer is provided by constructing an automorphism Ψ of G[G] which
Ille, P.
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

A Note on Hamiltonian Cycles in Lexicographical Products

J. Autom. Lang. Comb., 1997
A typical sufficient condition for the existence of a hamiltonian cycle in a lexicographical product $G[H]$ of two graphs $G$ and $H$ forces $G$ to contain a hamiltonian cycle or $G$ to contain a hamiltonian path and $H$ to have some additional properties.
openaire   +2 more sources

On forwarding indices of lexicographic product networks

Concurrency and Computation: Practice and Experience, 2019
SummaryOne of the important functions of a communication network is the routing. The communication and performance of a network whose efficiency can be directly affected by edge‐forwarding index of the routing and the edge‐forwarding index can be used to deterministically measure its efficiency.
openaire   +1 more source

Domination polynomial of lexicographic product of specific graphs

Journal of Information and Optimization Sciences, 2018
Saeid Alikhani, Somayeh Jahari
exaly  

Controllability of Lexicographic Product Networks

IEEE Transactions on Systems, Man, and Cybernetics: Systems
Bo Liu 0007   +3 more
openaire   +1 more source

Path 3-(edge-)connectivity of lexicographic product graphs

Discrete Applied Mathematics, 2020
Mingzu Zhang   +2 more
exaly  

On the super domination number of lexicographic product graphs

Discrete Applied Mathematics, 2019
Magda Dettlaff   +1 more
exaly  

Home - About - Disclaimer - Privacy