Skip to content
IJAMR International Journal of Applied Mathematical Research E-ISSN 2227-4324

Total Block Edge Cut Vertex Graph

Authors and Affiliations

  • Venkanagouda M Goudar Sri Siddhartha Institute of Technology, Tumkur, Karnataka, India.

About this article

DOI
https://doi.org/10.14419/ijamr.v1i4.204
Received
07-07-2012
Accepted
31-07-2012
Published
06-08-2012
Views
686
Downloads
363
Download PDF

Abstract

In this paper, we introduce the concept of the total block edge cut vertex graph. We obtain some properties of these graphs. We present characterization of graphs whose block edge cut vertex graphs planar outer planar, minimally non outer planar and crossing number one.

Author Biography

  • Venkanagouda M Goudar, Sri Siddhartha Institute of Technology, Tumkur, Karnataka, India.
    Mathematics

References

[1] Haray. F, Annals of New York, Academy of Sciences, (1977).

[2] Harrary.F, Graph Theory, Addison- Wesley Reading Mass, (1969).

[3] Kulli. V R, On minimally non outer planar graphs, proceedings of the Indian National Science Academy, 41, (1975).

[4] Sedlacek J., Some properties of interchange graphs. The Graphs and the applications. Academic press, New York, (1962).

[5] Y.B.Maralabhavi , Venkanagouda. M. Goudar., Block edge cutvertex graph, Acta Ciencia Vol.XXXIII M. No. 2. 493, (2007).


How to Cite

Goudar, V. M. (2012). Total Block Edge Cut Vertex Graph. International Journal of Applied Mathematical Research, 1(4), 371-376. https://doi.org/10.14419/ijamr.v1i4.204

Related Articles