5 citations · 8 across the 6 of their papers we have counts for
6 papers · 1 filter
Conditional and Unique Coloring of Graphs (revised resubmission)
P. V. Subba Reddy, K. V. Iyer
For integers and (where ), a conditional -coloring of a graph is a proper -coloring of the vertices of such that every vertex of…
Conditional and Unique Coloring of Graphs
P. Venkata Subba Reddy, K. Viswanathan Iyer
For integers , a conditional -coloring of a graph is a proper -coloring of the vertices of such that every vertex of degree in is adjacen…
Conditional coloring of some parameterized graphs
P. Venkata Subba Reddy, K. Viswanathan Iyer
For integers k>0 and r>0, a conditional (k,r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices…
On conditional coloring of some graphs
P. Venkata Subba Reddy, K. Viswanathan Iyer
For integers r and k > 0(k>r),a conditional (k, r)-coloring of a graph G is a proper k-coloring of G such that every vertex v of G has at least min{r,d(v)} differently colored neig…
Algorithms for enumerating and counting D2CS of some graphs
P. Venkata Subba Reddy, K. Viswanathan Iyer
A D2CS of a graph G is a set with . We study the problem of counting and enumerating D2CS of a graph. First we give an explicit formula for th…
A sharp lower bound for the Wiener index of a graph
R. Balakrishnan, N. Sridharan, K. V. Iyer
Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half the sum of the distances over all pairs of vertices of G. In practice, G corresponds to w…