[PDF] Top 20 More results on eccentric coloring in graphs

... is eccentric colorable, as the eccentric coloring is achieved based on the order p similar to the two previous ...the eccentric colorability of C p + ... See full document

... snake graphs admit this kind of ...related graphs, cycle related graphs, some planar graphs, some tree graphs, fan graph, helm graph, umbrella graph, gear graph, friendship and wheel ... See full document

... The cardinality of a smallest independent dominating set of G is called the independent number of G and is denoted by A subdivision of an edge e=uv of a graph G is the replacement of the[r] ... See full document

... Abstract. Given a positive integer r, two vertices u, v ∈ V (G) are r- independent if d(u, v) > r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance ... See full document

... such that for every edge 𝑢𝑤 ∈ 𝐸(𝐺), |𝑓(𝑢) − 𝑓(𝑤)| ∉ 𝑇. For more results on 𝑇-coloring one may refer [9, 6, 10] and the survey on 𝑇-coloring as discussed in [7]. The 𝑇-coloring of a ... See full document

... the eccentric connectivity index is more ...the eccentric connectivity index of any graph must be bounded by a cubic polynomial in the number of ...vertices results in a factor bounded by ... See full document

... Our algorithm is based directly on [5, 4], and a few results from [19] and [20] are used. It should be pointed out that the method presented here is significantly simpler and shorter than [20], while proving a ... See full document

... Abstract: Graphs considered in this study are finite simple ...Edge coloring properties of fan graph, star graph, bistar graph, helm graph, and friendship graph are investigated and their chromatic indices ... See full document

... This paper studies the Hamiltonian coloring and Hamiltonian chromatic number for different graphs .the main results are1.For any integer n greater than or equal to three, Hamiltonian chromatic number ... See full document

... antities are denoted p(G) and t(G) respectively. In [8,10] Boland et al. have discussed many interesting results about eccentric digraphs. Also they have listed open problems about these graphs. One ... See full document

...   , where  G ( ) v is the eccentricity of a vertex v in G and D v G ( ) is the sum of distances of all vertices in G from v . In this paper, we compute the eccentric distance sum of Volkmann tree and then we ... See full document

... There is also recent interest in variations of the CFCP such as requiring another vertex (not the selected vertex) to be colored within the neighborhood of a selected vertex. This allows for applications such as guiding ... See full document

... The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with ∆(G) + 2 colors. In this paper, we calculate the ... See full document

... Proof: Let G = ( A , B ) be a fuzzy graph on G ∗ : ( A , B ) .If d ( v ) = k ∀ v ∈ V .That is if each vertex has same degree k ,then G is regular fuzzy graph.If the number of vertex is odd number then the graph is said ... See full document

... of Graphs based on ...hued coloring. A (k, r)- coloring c of a graph G is a proper k-coloring of G such that for every v ∈ V (G), we have |c(N G (v))| ≥ min{d(v), ... See full document

... Eccentric graphs of other special kinds of graphs such as intersection graphs [10], trapezoid graphs [2] and so on can be ...of eccentric graphs of the type considered ... See full document

... Let e be any given edge of graph G = ( V E , ) . The number of sets which consist of e and two other edges ad- jacent to e at the same vertex, is less than ∆ 2 . For every k ≥ 3 , no edge lies in more than ∆ k− 2 ... See full document

... triangle-free graphs? Similarly as above, if G is a sufficiently large triangle-free graph in a fixed surface Σ, then G has a vertex of degree at most ...triangle-free graphs drawn in a fixed surface can be ... See full document

... Vernold Vivin, “On equitable coloring of central graphs and total graphs,” in International Conference on Graph Theory and Its Applications, vol.. 33 of Electronic Notes in Discrete Math[r] ... See full document

... The eccentric connectivity index [2-6]  C ( ) x of a graph G is defined as  C ( ) x   u V G  ( ) deg( ) ( ) u  u , where deg(u) denotes the degree of vertex u in G, ...the eccentric of some infinite ... See full document