Stability and operations on graphs
In this paper we give a detailed survey of stability properties of various combinations of graphs. We review previous work on unions, joins and (cartesian) products of graphs, and supply further evidence of the unpredictability of the stability index function under cartesian products in that we show...
Saved in:
| Published in | Combinatorial Mathematics III pp. 116 - 135 |
|---|---|
| Main Author | |
| Format | Book Chapter |
| Language | English |
| Published |
Berlin, Heidelberg
Springer Berlin Heidelberg
28.08.2006
|
| Series | Lecture Notes in Mathematics |
| Online Access | Get full text |
Cover
Loading…
| Summary: | In this paper we give a detailed survey of stability properties of various combinations of graphs.
We review previous work on unions, joins and (cartesian) products of graphs, and supply further evidence of the unpredictability of the stability index function under cartesian products in that we show that for r>2, the r-cube has stability index 1, which for most values of m and n the product Pm × Pn of two paths has stability index mn-7.
Finally, we discuss the stability properties of compositions (lexicographic products) and coronas of graphs, in particular finding infinite families of such graphs which are stable. |
|---|---|
| ISBN: | 9783540071549 3540071547 |
| ISSN: | 0075-8434 1617-9692 |
| DOI: | 10.1007/BFb0069551 |