scholarly journals Some Metrical Properties of Lattice Graphs of Finite Groups

Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 398
Author(s):  
Jia-Bao Liu ◽  
Mobeen Munir ◽  
Qurat-ul-Ain Munir ◽  
Abdul Rauf Nizami

This paper is concerned with the combinatorial facts of the lattice graphs of Z p 1 × p 2 × ⋯ × p m , Z p 1 m 1 × p 2 m 2 , and Z p 1 m 1 × p 2 m 2 × p 3 1 . We show that the lattice graph of Z p 1 × p 2 × ⋯ × p m is realizable as a convex polytope. We also show that the diameter of the lattice graph of Z p 1 m 1 × p 2 m 2 × ⋯ × p r m r is ∑ i = 1 r m i and its girth is 4.

1994 ◽  
Vol 3 (2) ◽  
pp. 157-166
Author(s):  
Martin Aigner ◽  
Regina Klimmek

In this paper we solve the following problem on the lattice graph L(m1,…,mn) and the Hamming graph H(m1,…,mn), generalizing a result of Felzenbaum-Holzman-Kleitman on the n-dimensional cube (all mi = 2): Characterize the vectors (s1.…,sn) such that there exists a maximum matching in L, respectively, H with exactly si edges in the ith direction.


Author(s):  
Simon R. Blackburn ◽  
Peter M. Neumann ◽  
Geetha Venkataraman
Keyword(s):  

2009 ◽  
Author(s):  
Tullio Ceccherini-Silberstein ◽  
Fabio Scarabotti ◽  
Filippo Tolli

2018 ◽  
Vol 60 (3) ◽  
pp. 506-517
Author(s):  
V. Amjid ◽  
W. Guo ◽  
B. Li
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document