Name
Abstract | ||
|---|---|---|
The problem of graphs admitting identifying codes is a recent topic. In this paper, we solve a question concerning the existence of @?-regular graphs admitting (1,@?@?)-identifying code. Moreover, our girth approach gives some improvements on the number of vertices of graphs which admit identifying codes. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ejc.2007.02.016 | Eur. J. Comb. |
Keywords | Field | DocType |
regular graph,girth approach,recent topic | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Chordal graph,Mathematics | Journal |
Volume | Issue | ISSN |
29 | 3 | 0195-6698 |
Citations | PageRank | References |
6 | 0.61 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tero Laihonen | 1 | 363 | 39.39 |