2006/01/31 by W. Bajguz, Wieslaw Bajguz, Bajguz, Wieslaw
Computer Science · Engineering · Mathematics · #05A18 #05C05 #05C30 #11B37 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #cs.DM #graph theory and CDMA systems #math.CO #msc:05A18 #msc:05C05 #msc:05C30 #msc:11B37
paper · pdf · doi:10.48550/arxiv.math/0601755
5 pages
arxiv created 2006/01/31 · openalex publication_date 2006/01/31 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Knopfmacher et all [1] was introduced the graph compositions` notion. In this note we add to these a new construction of tree-like graphs where nodes are graphs themselves. The first examples of these tree-like compositions, a corresponding theorem and resulting conclusions are provided.