Research Article

Edge Semientire Block Graph

by  Venkanagouda M Goudar, Jagadeesh N
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 89 - Issue 13
Published: March 2014
Authors: Venkanagouda M Goudar, Jagadeesh N
10.5120/15695-4595
PDF

Venkanagouda M Goudar, Jagadeesh N . Edge Semientire Block Graph. International Journal of Computer Applications. 89, 13 (March 2014), 42-44. DOI=10.5120/15695-4595

                        @article{ 10.5120/15695-4595,
                        author  = { Venkanagouda M Goudar,Jagadeesh N },
                        title   = { Edge Semientire Block Graph },
                        journal = { International Journal of Computer Applications },
                        year    = { 2014 },
                        volume  = { 89 },
                        number  = { 13 },
                        pages   = { 42-44 },
                        doi     = { 10.5120/15695-4595 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2014
                        %A Venkanagouda M Goudar
                        %A Jagadeesh N
                        %T Edge Semientire Block Graph%T 
                        %J International Journal of Computer Applications
                        %V 89
                        %N 13
                        %P 42-44
                        %R 10.5120/15695-4595
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

In this communications, the edge semientire block graph of a graph is introduced. We present a characterization of those graphs whose edge semientire block graph is planar, outer planar, Eulerian, Hamiltonian with crossing number one.

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.
  • Y. B. Maralabhavi and Venkanagouda. M. Goudar. "On Block edge cut vertex graph", in the Journal of ACTA CIENCIA INDICA, Vol. XXXIII M. No. 2, (2007) pp. 493-497.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Edge Semientire graph line graph inner vertex number

Powered by PhDFocusTM