When G^2 is a Konig-Egervary graph?

Details When G^2 is a Konig-Egervary graph? When G^2 is a Konig-Egervary graph?

2010-04-27

arxiv.org/abs/1004.4804v1

Computer Science

Discrete Mathematics

6 pages, 4 figures

Scientific paper

The square of a graph G is the graph G^2 with the same vertex set as in G, and an edge of G^2 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(G^2), where alpha(G) is the size of a maximum stable set in G. In this paper we show that G^2 is a Konig-Egervary graph if and only if G is a square-stable Konig-Egervary graph.

Affiliated with

Also associated with

No associations

Rating

When G^2 is a Konig-Egervary graph? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with When G^2 is a Konig-Egervary graph?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When G^2 is a Konig-Egervary graph? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-237338