Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More
Edge Semientire Block Graph
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 89 - Number 13
Year of Publication: 2014
|
10.5120/15695-4595 |
Venkanagouda M Goudar and Jagadeesh N. Article: Edge Semientire Block Graph. International Journal of Computer Applications 89(13):42-44, March 2014. Full text available. BibTeX
@article{key:article,
author = {Venkanagouda M Goudar and Jagadeesh N},
title = {Article: Edge Semientire Block Graph},
journal = {International Journal of Computer Applications},
year = {2014},
volume = {89},
number = {13},
pages = {42-44},
month = {March},
note = {Full text available}
}
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.