Characterizing 2-distance graphs

• المؤلفون الرئيسيون: Ching, Ramuel P, Garces, Ian June L
• التنسيق: text
• منشور في: Archīum Ateneo 2019
• الموضوعات: Distance in graphs; 2-distance graph; complement of a graph; cocktail party graph; bipartite graph; complete graph; Mathematics
• الوصول للمادة أونلاين: https://archium.ateneo.edu/mathematics-faculty-pubs/52; https://www.worldscientific.com/doi/abs/10.1142/S1793557119500062
• المؤسسة: Ateneo De Manila University

Let X be a finite simple graph. The 2-distance graph D2(X) of X is the graph with the same vertex set as X and two vertices are adjacent if and only if their distance in X is exactly 2. A graph G is a 2-distance graph if there exists a graph X such that D2(X)≅G. In this paper, we give three characte...