Name
Abstract | ||
|---|---|---|
For a graph G with vertices v"1,v"2,...,v"n, a simple set representation of G is a family F={S"1,S"2,...,S"n} of distinct nonempty sets such that |S"i@?S"j|=1 if v"iv"j is an edge in G, and |S"i@?S"j|=0 otherwise. Let S(F)=@?"i"="1^nS"i, and let @w"s(G) denote the minimum |S(F)| of a simple set representation F of G. If, for every two minimum simple set representations F and F^' of G, F can be obtained from F^' by a bijective mapping from S(F^') to S(F), then G is said to be s-uniquely intersectable. In this paper, we are concerned with the s-unique intersectability of diamond-free graphs, where a diamond is a K"4 with one edge deleted. Moreover, for a diamond-free graph G, we also derive a formula for computing @w"s(G). |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2011.01.012 | Discrete Applied Mathematics |
Keywords | Field | DocType |
distinct nonempty,set representation,uniquely intersectable,bijective mapping,family f,clique partition,vertices v,diamond-free graphs,simple set representation f,minimum simple set representation,graph g,simple set representation,s-unique intersectability,diamond-free graph | Diamond,Discrete mathematics,Graph,Combinatorics,Bijection,Vertex (geometry),Simple set,Set representation,Function composition,Partition (number theory),Mathematics | Journal |
Volume | Issue | ISSN |
159 | 8 | Discrete Applied Mathematics |
Citations | PageRank | References |
1 | 0.47 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun-Lin Guo | 1 | 2 | 1.31 |
| Tao-Ming Wang | 2 | 59 | 12.79 |
| Yue-Li Wang | 3 | 551 | 51.40 |