無 / A multiple-star representation of a simple graph G assigns each vertex a union of stars in a host tree, such that vertices are adjacent if and only if their assigned sets intersect. The total star number S(G) is the minimum of the total number of stars used in any such representation of G. We obtain the maximum value of S(G) for m-edge connected graphs: m + 1, n-vertex graphs: [n<sup>2</sup> + 1)/ 4], and n-vertex outer-planar graphs: [3n /2-l]
| Identifer | oai:union.ndltd.org:CHENGCHI/B2002002524 |
| Creators | 呂吉祥 |
| Publisher | 國立政治大學 |
| Source Sets | National Chengchi University Libraries |
| Language | 英文 |
| Detected Language | English |
| Type | text |
| Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.002 seconds