Name
Abstract | ||
|---|---|---|
The cycle code of a graph is the binary linear span of the characteristic vectors of circuits. We characterize the graphs whose cycle codes are maximal for the packing problem, based on characterizing the graphs whose girth is at least 1 2 (n−c) +1 where n and c are the numbers of vertices and connected components. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0012-365X(94)90132-5 | Discrete Mathematics |
Keywords | Field | DocType |
cycle code | Discrete mathematics,Indifference graph,Combinatorics,Graph homomorphism,Chordal graph,Cycle graph,Graph product,Symmetric graph,Butterfly graph,Mathematics,Split graph | Journal |
Volume | Issue | ISSN |
128 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.54 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrick Solé | 1 | 48 | 12.83 |
| T. Zaslavsky | 2 | 297 | 56.67 |