Skip to content
Log in
Sponsored AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI

Author

C. R. Parvathy

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Oct 2026

Bounds on Doubly Connected Fair Dominations in Graphs

. A dominating set 𝐃 of graph 𝐆 = (𝐕, 𝐄) is a doubly connected fair dominating set (dcfd-set) if it satisfies the following conditions: (1) the induced subgraphs < 𝐃 > and < 𝐕\𝐃 > are connected and (2) every vertex not in 𝐃 are dominated by the equal number of vertices from 𝐃 . The dcfd(G) is the minimum cardinality of...

R. Surya, C. R. Parvathy · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.