• Title/Summary/Keyword: r-maximum index of graphs

Search Result 2, Processing Time 0.018 seconds

THE RANGE OF r-MAXIMUM INDEX OF GRAPHS

  • Choi, Jeong-Ok
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.5
    • /
    • pp.1397-1404
    • /
    • 2018
  • For a connected graph G, an r-maximum edge-coloring is an edge-coloring f defined on E(G) such that at every vertex v with $d_G(v){\geq}r$ exactly r incident edges to v receive the maximum color. The r-maximum index $x^{\prime}_r(G)$ is the least number of required colors to have an r-maximum edge coloring of G. In this paper, we show how the r-maximum index is affected by adding an edge or a vertex. As a main result, we show that for each $r{\geq}3$ the r-maximum index function over the graphs admitting an r-maximum edge-coloring is unbounded and the range is the set of natural numbers. In other words, for each $r{\geq}3$ and $k{\geq}1$ there is a family of graphs G(r, k) with $x^{\prime}_r(G(r,k))=k$. Also, we construct a family of graphs not admitting an r-maximum edge-coloring with arbitrary maximum degrees: for any fixed $r{\geq}3$, there is an infinite family of graphs ${\mathcal{F}}_r=\{G_k:k{\geq}r+1\}$, where for each $k{\geq}r+1$ there is no r-maximum edge-coloring of $G_k$ and ${\Delta}(G_k)=k$.

THE ZEROTH-ORDER GENERAL RANDIĆ INDEX OF GRAPHS WITH A GIVEN CLIQUE NUMBER

  • Du, Jianwei;Shao, Yanling;Sun, Xiaoling
    • Korean Journal of Mathematics
    • /
    • v.28 no.3
    • /
    • pp.405-419
    • /
    • 2020
  • The zeroth-order general Randić index 0Rα(G) of the graph G is defined as ∑u∈V(G)d(u)α, where d(u) is the degree of vertex u and α is an arbitrary real number. In this paper, the maximum value of zeroth-order general Randić index on the graphs of order n with a given clique number is presented for any α ≠ 0, 1 and α ∉ (2, 2n-1], where n = |V (G)|. The minimum value of zeroth-order general Randić index on the graphs with a given clique number is also obtained for any α ≠ 0, 1. Furthermore, the corresponding extremal graphs are characterized.