# L. Pushpalatha

• Discrete Mathematics
• 1996
Let G = (V, E) be a graph and u, v ~ V. Then, u strongly dominates v and v weakly dominates u if (i) uv ~ E and (ii) deg u >/deg v. A set D c V is a strong-dominating set (sd-set) of G if everyâ€¦ (More)
• 6
• Discrete Mathematics
• 2012
Given an integer k â‰¥ 2, we consider vertex colorings of graphs in which no k-star subgraph Sk = K1,k is polychromatic. Equivalently, in a star-[k]-coloring the closed neighborhood N[v] of each vertexâ€¦ (More)
• 1
• Discrete Applied Mathematics
• 2011
For an integer k â‰¥ 1, the k-improper upper chromatic number Ï‡Ì„k-imp(G) of a graph G is introduced here as the maximum number of colors permitted to color the vertices of G such that, for any vertex vâ€¦ (More)
• Graphs and Combinatorics
• 1998
Let G Âˆ Â…V ;EÂ† be a graph and P Âˆ fV1;V2; . . . ;Vkg be a partition of V . The kcomplement G k (with respect to P) is deÂ®ned as follows: For all Vi and Vj in P, i 0 j, remove the edges between Vi andâ€¦ (More)
For an integer n â‰¥ 2, let I âŠ‚ {0, 1, 2, Â· Â· Â· , n}. A Smarandachely Roman sdominating function for an integer s, 2 â‰¤ s â‰¤ n on a graph G = (V,E) is a function f : V â†’ {0, 1, 2, Â· Â· Â· , n} satisfyingâ€¦ (More)
• Discrete Mathematics
• 2012
Three edges e1, e2 and e3 in a graph G are consecutive if they form a path (in this order) or a cycle of length 3. The 3 -consecutive edge coloring number Ïˆâ€² 3c(G) of G is the maximum number ofâ€¦ (More)
• â€¹
• 1
• â€º