Name
Abstract | ||
|---|---|---|
Let C 2(M) be the second order circuit graph of a simple connected matroid M, then C 2(M) is 2-connected if M has more than one circuit and M is not a line. Moreover, C 2(M) has diameter at most two if and only if M does not have any restriction isomorphic to U 2,6. © 2011 Springer. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00373-011-1074-6 | Graphs and Combinatorics |
Keywords | Field | DocType |
circuit graph of a matroid,connectivity,diameter,matroid,second order circuit graph of a matroid | Matroid,Discrete mathematics,Topology,Combinatorics,k-edge-connected graph,Matroid partitioning,Dual graph,Graphic matroid,Weighted matroid,Circuit rank,Mathematics,Branch-decomposition | Journal |
Volume | Issue | ISSN |
28 | 5 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinquan Xu | 1 | 18 | 6.20 |
| Ping Li | 2 | 21 | 7.14 |
| Hong-Jian Lai | 3 | 631 | 97.39 |