Name
Abstract | ||
|---|---|---|
Given a coloring f:V(G)->N of graph G and any subgraph [email protected]?G we define f"s(H)[email protected]?"v"@?"V"("H")f(v). In particular, we denote f"s(G) by S(f). The coloring f is called an IC-coloring if for any integer [email protected]?[1,S(f)] there is a connected subgraph [email protected]?G such that f"s(H)=k. Also, we define the IC-index of G to beM(G)=max{S(f):f is an IC-coloring of G}.In this paper we examine some well-known classes of graphs and determine their IC-indices. In addition, several conjectures are proposed. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.disc.2004.02.026 | Discrete Mathematics |
Keywords | Field | DocType |
ic-coloring,ic-index of a graph.,ic-index of a graph | Integer,Discrete mathematics,Graph,Combinatorics,Graph colouring,Vertex connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
299 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.50 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ebrahim Salehi | 1 | 16 | 4.82 |
| Sin-Min Lee | 2 | 46 | 16.01 |
| Mahdad Khatirinejad | 3 | 30 | 5.08 |