On $α$-Square-Stable Graphs

Details On $α$-Square-Stable Graphs On $α$-Square-Stable Graphs

1999-12-30

arxiv.org/abs/math/9912234v1

Mathematics

Combinatorics

13 pages, 6 figures

Scientific paper

The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G) + mu(G) equals its order, then G is a Koenig-Egervary graph. We call G an $\alpha $-square-stable graph, shortly square-stable, if alpha(G) = alpha(G*G), where G*G denotes the second power of G. These graphs were first investigated by Randerath and Wolkmann. In this paper we obtain several new characterizations of square-stable graphs. We also show that G is an square-stable Koenig-Egervary graph if and only if it has a perfect matching consisting of pendant edges. Moreover, we find that well-covered trees are exactly square-stable trees. To verify this result we give a new proof of one Ravindra's theorem describing well-covered trees.

Affiliated with

Also associated with

No associations

Rating

On $α$-Square-Stable Graphs 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 On $α$-Square-Stable Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On $α$-Square-Stable Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-505057