Name
Abstract | ||
|---|---|---|
Given a set R of affine subspaces in R^d of dimension e, its intersection graph G has a vertex for each subspace, and two vertices are adjacent in G if and only if their corresponding subspaces intersect. For each pair of positive integers d and e we obtain the class of (d,e)-subspace intersection graphs. We classify the classes of (d,e)-subspace intersection graphs by containment, for e=1 or e=d-1 or [email protected]?4. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2010.06.042 | Discrete Mathematics |
Keywords | Field | DocType |
affine dimension,intersection graphs | Discrete mathematics,Indifference graph,Combinatorics,Vertex (geometry),Subspace topology,Vertex (graph theory),Chordal graph,Linear subspace,Intersection graph,Intersection number (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
310 | 23 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joshua D. Laison | 1 | 38 | 7.08 |
| Yulan Qing | 2 | 0 | 0.34 |