|
|
|
|
decomposition of complete graphs into disconnected bipartite graphs with seven edges and eight vertices
|
|
|
|
|
|
|
|
نویسنده
|
froncek dalibor ,kubesa michael
|
|
منبع
|
communications in combinatorics and optimization - 2026 - دوره : 11 - شماره : 2 - صفحه:661 -684
|
|
چکیده
|
In this paper, we continue investigation of decompositions of complete graphs into graphs with seven edges. the spectrum has been completely determined for such graphs with at most six vertices. connected graphs with seven edges and seven vertices are necessarily unicyclic and the spectrum for bipartite ones was completely determined by the authors. connected graphs with seven edges and eight vertices are trees and the spectrum was found by huang and rosa. as a next step in the quest of completing the spectrum for all graphs with seven edges, we completely solve the case of disconnected bipartite graphs with seven edges and eight vertices.
|
|
کلیدواژه
|
graph decomposition ,$g$-design ,$rho$-labeling
|
|
آدرس
|
university of minnesota duluth, department of mathematics and statistics, usa, všb-technical university of ostrava, department of applied mathematics, czech republic
|
|
پست الکترونیکی
|
michael.kubesa@vsb.cz
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|