Weak saturation numbers of and
A graph is weakly -saturated if contains no copy of , and there is an ordering of all edges of so that if they are added one at a time, they form a complete graph and each edge added creates a new copy of . The minimum size of a weakly -saturated graph of order is weak saturation number, denoted by...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.04.003 |
| Summary: | A graph is weakly -saturated if contains no copy of , and there is an ordering of all edges of so that if they are added one at a time, they form a complete graph and each edge added creates a new copy of . The minimum size of a weakly -saturated graph of order is weak saturation number, denoted by . Let denote the complete graph with vertices, denote the complete bipartite graph with partite sizes of and , and denote the complement of . In this paper, we determine and whose significance can be seen in the introduction. |
|---|---|
| ISSN: | 0972-8600 |