References
- Acharya, B. D, Gupta, P. (1997). On point-set domination in graphs ii: Independent psd-sets. J. Combin. Inform. Syst. Sci. 22(2): 133–148.
- Acharya, B. D, Gupta, P. (2000). On point-set domination in graphs ii: Quest to characterize blocks containing independent psd-sets. Nat. Acad. Sci. Lett. 23(11): 171–176.
- Chartrand, G, Lesniak, L. (2005). Graphs & Digraphs, 4th ed. Boca Raton, FL: Chapman & Hall/CRC.
- Gupta, P., Goyal, A, Jain, R. (2020). Independent point-set dominating sets in graphs. AKCE Int. J. Graphs Comb. 17(1): 229–241.
- Harary, F. (1969). Graph Theory. Reading, MA; Menlo Park, CA; London, UK: Addison-Wesley Publishing Co.
- Henning, M. A., Joos, F., Löwenstein, C, Sasse, T. (2016). Induced cycles in graphs. Graphs Combin. 32(6): 2425–2441.
- Jou, M.-J. (2010). Characterization of graphs with equal domination numbers and independence numbers. Taiwanese J. Math. 14(4): 1537–1542.
- Lehot, P. G. H. (1974). An optimal algorithm to detect a line graph and output its root graph. J. ACM 21(4): 569–575.
- Roussopoulos, N. D. (1973). A max {m, n} algorithm for determining the graph H from its line graph G. Inform. Process. Lett. 2(4): 108–112.
- Sampathkumar, E, Latha, L. P. (1993). Point-set domination number of a graph. Ind. J. Pure Appl. Math. 24(4): 225–229.
- Truszczynski, M. (1984). Graceful unicyclic graphs. Demonstr. Math. 17(2): 377–387.