Results 41 to 50 of about 235,976 (317)
On the hamiltonicity of the cartesian product
Information Processing Letters, 2005 We examine the hamiltonicity of the cartesian product P = G1×G2 of two graphs G1, G2. We provide necessary and/or sufficient conditions for P to be hamiltonian, depending on the hamiltonian properties of G1 and G2, with corresponding constructions. We also prove a conjecture by Batagelj and Pisanski related to the 'cyclic hamiltonicity' of a graph.
Dimakopoulos, V. V. +2 more
openaire +2 more sources
Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs [PDF]
Transactions on Combinatorics, 2017 Let $G$ be a graph and $chi^{prime}_{aa}(G)$ denotes the minimum number of colors required for an acyclic edge coloring of $G$ in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for $
Fatemeh Sadat Mousavi, Massomeh Noori
doaj +1 more source
Cartesian products as profinite completions [PDF]
International Mathematics Research Notices, 2006 We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups under some natural restrictions.
Kassabov, M, Nikolov, N
openaire +4 more sources
MDR codes and self-dual codes on Cartesian product codes
Tongxin xuebao, 2010 A Cartesian product code of the linear codes C1 , , C s in 1 , ,Z r Z rs was defined. According to the theorem of submodulo isomorphism, the relationship between the rank of the Cartesian product code C1 × C 2 × × Cs over Z r1 × Z r2 × × Zrsand C1 , C 2,
LIU Xiu-sheng
doaj +2 more sources
On a product of universal hyperalgebras
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 We introduce and study a new operation of product of universal hyperalgebras which lies, with respect to set inclusion, between the cartesian product of the hyperalgebras and the cartesian product of their idempotent hulls.
Chaisansuk Nitima, Šlapal Josef
doaj +1 more source
Total irregularity strength for product of two paths
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper we define a totally irregular total labeling for Cartesian and strong product of two paths, which is at the same time vertex irregular total labeling and also edge irregular total labeling.
Muhammad Kamran Siddiqui +2 more
doaj +1 more source
Transitive simple subgroups of wreath products in product action
, 2003 A transitive simple subgroup of a finite symmetric group is very rarely contained in a full wreath product in product action. All such simple permutation groups are determined in this paper.
Baddeley, Robert W. +2 more
core +2 more sources
Advanced Engineering Materials, EarlyView.Hydrostatic bearings excel in high‐precision applications, but their performance hinges on a continuous external supply. This study evaluates various material combinations for sliding surfaces to mitigate damage during supply failures or misalignment and to discover the most effective materials identified for enhancing the reliability and efficiency of
Michal Michalec +6 more
wiley +1 more source
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Discussiones Mathematicae Graph Theory, 2017 Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source
Betweenness centrality in Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj +1 more source