2010/04/27 by Vadim E. Levit, Levit, Vadim E., Eugen Mândrescu +2
Computer Science · Mathematics · #05C05 #05C69 #Advanced Operator Algebra Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Geometric and Algebraic Topology #Homotopy and Cohomology in Algebraic Topology #Primary 05C78 #Secondary 05C12 #cs.DM #math.CO #msc:05C05 #msc:05C12 #msc:05C69 #msc:05C78
paper · pdf · doi:10.48550/arxiv.1004.4804
6 pages, 4 figures
arxiv created 2010/04/27 · openalex publication_date 2010/04/27 · arxiv updated 2015/03/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The square of a graph G is the graph G2 with the same vertex set as in G, and an edge of G2 is joining two distinct vertices, whenever the distance between them in G is at most 2. G is a square-stable graph if it enjoys the property alpha(G)=alpha(G2), where alpha(G) is the size of a maximum stable set in G. In this paper we show that G2 is a Konig-Egervary graph if and only if G is a square-stable Konig-Egervary graph.