Research Article

Top Semirelib Graph of a Tree

by  K. B. Manjunatha Prasad, Venkanagouda M. Goudar, Shiva Kumar K B
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Issue 22
Published: April 2013
Authors: K. B. Manjunatha Prasad, Venkanagouda M. Goudar, Shiva Kumar K B
10.5120/11525-7246
PDF

K. B. Manjunatha Prasad, Venkanagouda M. Goudar, Shiva Kumar K B . Top Semirelib Graph of a Tree. International Journal of Computer Applications. 67, 22 (April 2013), 9-12. DOI=10.5120/11525-7246

                        @article{ 10.5120/11525-7246,
                        author  = { K. B. Manjunatha Prasad,Venkanagouda M. Goudar,Shiva Kumar K B },
                        title   = { Top Semirelib Graph of a Tree },
                        journal = { International Journal of Computer Applications },
                        year    = { 2013 },
                        volume  = { 67 },
                        number  = { 22 },
                        pages   = { 9-12 },
                        doi     = { 10.5120/11525-7246 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2013
                        %A K. B. Manjunatha Prasad
                        %A Venkanagouda M. Goudar
                        %A Shiva Kumar K B
                        %T Top Semirelib Graph of a Tree%T 
                        %J International Journal of Computer Applications
                        %V 67
                        %N 22
                        %P 9-12
                        %R 10.5120/11525-7246
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

In this communications, the concept of top semirelib graph of a planar graph is introduced. We present a characterization of graphs, whose top semirelib graphs are always seperable. Further characterize graph whose plan Tps(T ) is planar and outer planar. Lastly we proved that Tps(T ) is always noneulerian and non Hamiltonian.

References
  • Chartrand G, Geller, D and Hedetniemi, S. J. Combinatorial Theory (1971)10:12.
  • Harary F. , Graph theory, Addition - Weseley Reading . Mass. (1969), pp 34 and 107.
  • Harary, F. , Annals of New York Academy of Science,(1975),175 :198.
  • Kulli V R . , On Minimally Non- Outer Planar Graphs, Proceeding of the Indian National Science Academy, Vol. 41, Part A, No. 3 (1975), pp 275 -280.
  • Venkanagouda M Goudar. , K B Manjunatha. "Pathos Semirelib Graph of a Tree", in the Global Journal of Mathematical Sciences: Theory and Practical Vol 5, No. 2,(2013),pp1-6.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Top Semirelib

Powered by PhDFocusTM