CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Top Semirelib Graph of a Tree

by K. B. Manjunatha Prasad, Venkanagouda M. Goudar, Shiva Kumar K B
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Number 22
Year of Publication: 2013
Authors: K. B. Manjunatha Prasad, Venkanagouda M. Goudar, Shiva Kumar K B
10.5120/11525-7246

K. B. Manjunatha Prasad, Venkanagouda M. Goudar, Shiva Kumar K B . Top Semirelib Graph of a Tree. International Journal of Computer Applications. 67, 22 ( April 2013), 9-12. DOI=10.5120/11525-7246

@article{ 10.5120/11525-7246,
author = { K. B. Manjunatha Prasad, Venkanagouda M. Goudar, Shiva Kumar K B },
title = { Top Semirelib Graph of a Tree },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 67 },
number = { 22 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 9-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume67/number22/11525-7246/ },
doi = { 10.5120/11525-7246 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:26:07.792079+05:30
%A K. B. Manjunatha Prasad
%A Venkanagouda M. Goudar
%A Shiva Kumar K B
%T Top Semirelib Graph of a Tree
%J International Journal of Computer Applications
%@ 0975-8887
%V 67
%N 22
%P 9-12
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this communications, the concept of top semirelib graph of a planar graph is introduced. We present a characterization of graphs, whose top semirelib graphs are always seperable. Further characterize graph whose plan Tps(T ) is planar and outer planar. Lastly we proved that Tps(T ) is always noneulerian and non Hamiltonian.

References
  1. Chartrand G, Geller, D and Hedetniemi, S. J. Combinatorial Theory (1971)10:12.
  2. Harary F. , Graph theory, Addition - Weseley Reading . Mass. (1969), pp 34 and 107.
  3. Harary, F. , Annals of New York Academy of Science,(1975),175 :198.
  4. 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.
  5. Venkanagouda M Goudar. , K B Manjunatha. "Pathos Semirelib Graph of a Tree", in the Global Journal of Mathematical Sciences: Theory and Practical Vol 5, No. 2,(2013),pp1-6.
Index Terms

Computer Science
Information Sciences

Keywords

Top Semirelib

Powered by PhDFocusTM