Semirelib Cutvertex graph

Authors

  • Dr. Venkanagouda M Goudar

  • K B Manjunatha Prasad

blocks, edge degree, inner vertex number, line graph, regions., regions

Abstract

In this communucations, the concept of semirelib cutvertex graph of a planar graph is introduced. We presen a characterization of those graphs whose semirelib cutvertex graphs are planar, outer planar, eulerian, hamiltonian with crossing number one.

Downloads

How to Cite

Semirelib Cutvertex graph. (2013). Global Journal of Science Frontier Research, 13(5), 55-60. https://journalofscience.org/index.php/GJSFR/article/view/

 

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

Geller Chartrand G, D, Hedetniemi, S. Theory (1971) 10:12. 10, 12.

Graph Harary F, Addition .Mass (1969) Graph theory.

(1975) 175 :198. 175, 198.

Semirelib Cutvertex Graph

Published

2013-02-06

Issue

Vol. 13 No. 5 (2013): GJSFR, Volume 13, Issue 5 (F1), Year 2013

Section

Articles

License

Copyright (c) 2013 Authors and Global Journals Private Limited

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Semirelib Cutvertex graph. (2013). Global Journal of Science Frontier Research, 13(5), 55-60. https://journalofscience.org/index.php/GJSFR/article/view/