Name
Abstract | ||
|---|---|---|
The vertex-distinguishing index @g\"s^'(G) of a graph G is the minimum number of colours required to properly colour the edges of G in such a way that any two vertices are incident with different sets of colours. We consider this parameter for some regular graphs. Moreover, we prove that for any graph, the value of this invariant is not changed if the colouring above is, in addition, required to be equitable. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.07.019 | Discrete Mathematics |
Keywords | Field | DocType |
equitable colouring,05c15,edge colouring,vertex-distinguishing index,indexation,difference set,regular graph | Random regular graph,Discrete mathematics,Combinatorics,Strongly regular graph,Vertex-transitive graph,Graph power,Cycle graph,Regular graph,Symmetric graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
308 | 5-6 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.44 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janka Rudašová | 1 | 2 | 0.44 |
| Roman Soták | 2 | 128 | 24.06 |