Vertex Semientire Block Graph

Dr. Venkanagouda M Goudar; Rajanna N E

Authors

Dr. Venkanagouda M Goudar
Rajanna N E

inner vertex number, line graph, outerplanar, vertex semientire graph

Abstract

In this communications, the concept of the vertex semientire block graph is introduced. We present characterization of graphs whose vertex semientire block graph is planar, outerplanar and minimally non-outerplanar. Also we establish a characterization of graphs whose vertex semientire block graph is Eulerian.

Downloads

How to Cite

Vertex Semientire Block Graph. (2014). Global Journal of Science Frontier Research, 14(7), 1-4. https://journalofscience.org/index.php/GJSFR/article/view/

Download Citation

Author Biography

Dr. Venkanagouda M Goudar

Dr. Venkanagouda M Goudar is a Professor in the Department of Mathematics at Sri Siddhartha Institute of Technology, Tumkur, Karnataka, India. He earned his Ph.D. in Mathematics from Bangalore University in 2008. His research primarily focuses on Graph Theory, with contributions to topics such as semirelib cutvertex graphs, non-split geodetic numbers, and vertex semientire block graphs. Dr. Goudar has authored over 40 publications, accumulating 48 citations and an h-index of 4. He also serves as a reviewer for the Global Journal of Science Frontier Research (GJSFR). His academic presence is further established through his ORCID (0000-0002-9738-4236) and Scopus profiles.

References

F. Haray (1977) 175, 198. 175, 198.

F. Harrary (1969) Graph Theory. 72, 72, 107.

V. Kulli (1975) On minimally nonouterplanar graphs. 41A.

V. Kulli, D. Akka (1980) 14(6), 585-588.

J. Sedlacek (1962) Some properties of interchange graphs. The Graphs and the applications.

M. Venkanagouda, Goudar Venkanagouda. M. Goudar, "On Pathos vertex semientire graph of a tree". (4), 666-670.