scholarly journals Equitable 2-partitions of the Hamming graphs with the second eigenvalue

2020 ◽  
Vol 343 (11) ◽  
pp. 112039
Author(s):  
Ivan Mogilnykh ◽  
Alexandr Valyuzhenich
Author(s):  
Evgeny A. Bespalov ◽  
Denis S. Krotov ◽  
Aleksandr A. Matiushev ◽  
Anna A. Taranenko ◽  
Konstantin V. Vorob'ev
Keyword(s):  

2011 ◽  
Vol 24 (9) ◽  
pp. 1608-1613 ◽  
Author(s):  
Boram Park ◽  
Yoshio Sano
Keyword(s):  

2010 ◽  
Vol 62 (4) ◽  
pp. 808-826
Author(s):  
Eveline Legendre

AbstractWe study extrema of the first and the second mixed eigenvalues of the Laplacian on the disk among some families of Dirichlet–Neumann boundary conditions. We show that the minimizer of the second eigenvalue among all mixed boundary conditions lies in a compact 1-parameter family for which an explicit description is given. Moreover, we prove that among all partitions of the boundary with bounded number of parts on which Dirichlet and Neumann conditions are imposed alternately, the first eigenvalue is maximized by the uniformly distributed partition.


2021 ◽  
Vol 28 (2) ◽  
Author(s):  
Jia Huang

The Norton product is defined on each eigenspace of a distance regular graph by the orthogonal projection of the entry-wise product. The resulting algebra, known as the Norton algebra, is a commutative nonassociative algebra that is useful in group theory due to its interesting automorphism group. We provide a formula for the Norton product on each eigenspace of a Hamming graph using linear characters. We construct a large subgroup of automorphisms of the Norton algebra of a Hamming graph and completely describe the automorphism group in some cases. We also show that the Norton product on each eigenspace of a Hamming graph is as nonassociative as possible, except for some special cases in which it is either associative or equally as nonassociative as the so-called double minus operation previously studied by the author, Mickey, and Xu. Our results restrict to the hypercubes and extend to the halved and/or folded cubes, the bilinear forms graphs, and more generally, all Cayley graphs of finite abelian groups.


2020 ◽  
Vol 20 (01) ◽  
pp. 2050004
Author(s):  
LAN LIN ◽  
YIXUN LIN

The minimum stretch spanning tree problem for a graph G is to find a spanning tree T of G such that the maximum distance in T between two adjacent vertices is minimized. The minimum value of this optimization problem gives rise to a graph invariant σ(G), called the tree-stretch of G. The problem has been proved NP-hard. In this paper we present a general approach to determine the exact values σ(G) for a series of typical graphs arising from communication networks, such as Hamming graphs and higher-dimensional grids (including hypercubes).


1992 ◽  
Vol 102 (2) ◽  
pp. 197-218 ◽  
Author(s):  
Elke Wilkeit
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document