Name
Abstract | ||
|---|---|---|
graph G of order n is called arbitrarily vertex decomposable if for each sequence (n"1,...,n"k) of positive integers with n"1+...+n"k=n, there exists a partition (V"1,...,V"k) of the vertex set of G such that V"i induces a connected subgraph of order n"i, for all i=1,...,k. A sun with r rays is a unicyclic graph obtained by adding r hanging edges to r distinct vertices of a cycle. We characterize all arbitrarily vertex decomposable suns with at most three rays. We also provide a list of all on-line arbitrarily vertex decomposable suns with any number of rays. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.02.019 | Discrete Mathematics |
Keywords | Field | DocType |
dominating cycle,arbitrary partition (vertex decomposition) of graphs,partition on-line,arbitrary partition of graphs,graph partitioning | Integer,Suns in alchemy,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Existential quantification,Vertex (graph theory),Neighbourhood (graph theory),Partition (number theory),Mathematics | Journal |
Volume | Issue | ISSN |
309 | 11 | Discrete Mathematics |
Citations | PageRank | References |
7 | 0.87 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafał Kalinowski | 1 | 48 | 10.75 |
| Monika Pilśniak | 2 | 28 | 9.31 |
| Mariusz Woźniak | 3 | 204 | 34.54 |
| Irmina Zioło | 4 | 7 | 1.21 |