Results 11 to 20 of about 1,343 (197)
Edge-Transitive Lexicographic and Cartesian Products [PDF]
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 +7 more sources
Some diameter notions in lexicographic product [PDF]
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 +4 more sources
Infinite lexicographic products [PDF]
Annals of Pure and Applied Logic, 2022 20 pages, 3 ...
Meir, Nadav
openaire +4 more sources
Hamiltonian decomposition of lexicographic product [PDF]
Journal of Combinatorial Theory, Series B, 1981 AbstractIn this paper we prove the conjecture of J.-C. Bermond (Ann. Discrete Math. 36 (1978), 21–28): If two graphs are decomposable into Hamiltonian cycles, then their lexicographic product is decomposable, too.
Zsolt Baranyai, Gy. R. Szász
openaire +3 more sources
Game chromatic number of lexicographic product graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2015 In this paper, we determine the exact values of the game chromatic number of lexicographic product of path P2 with path Pn, star K1,n and wheel Wn. Also we give an upper bound for the game chromatic number of lexicographic product of any two simple ...
R. Alagammai, V. Vijayalakshmi
doaj +2 more sources
On matching extendability of lexicographic products [PDF]
RAIRO - Operations Research, 2017 Summary: A graph \(G\) of even order is \(\ell\)-extendable if it is of order at least \(2\ell+2\), contains a matching of size \(\ell\), and if every such matching is contained in a perfect matching of \(G\). In this paper, we study the extendability of lexicographic products of graphs.
Nina Chiarelli +4 more
core +7 more sources
Star-extremal graphs and the lexicographic product [PDF]
Discrete Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guogang Gao, Xuding Zhu
openaire +2 more sources
A lexicographic product for signed graphs [PDF]
Australas. J Comb., 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 +5 more sources
The pre-hull number and lexicographic product [PDF]
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peterin, Iztok, Iztok Peterin
openaire +3 more sources
The Tshivenḓa-English Ṱahalusamaipfi/Dictionary as a Product of South African Lexicographic Processes [PDF]
Lexikos, 2011 <p>ABSTRACT: The publication of a dictionary is regarded as the result of a lexicographic process. Three subtypes of a lexicographic process have been noted, namely the primary comprehensive, the secondary comprehensive and the dictionary specific ...
Mbulungeni Madiba, Dion Nkomo
doaj +3 more sources