CFP last date
20 May 2024
Reseach Article

Line Graphs and Quasi-Total Graphs

by Bhavanari Satyanarayana, Devanaboina Srinivasulu, Kuncham Syam Prasad
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 105 - Number 3
Year of Publication: 2014
Authors: Bhavanari Satyanarayana, Devanaboina Srinivasulu, Kuncham Syam Prasad
10.5120/18356-9483

Bhavanari Satyanarayana, Devanaboina Srinivasulu, Kuncham Syam Prasad . Line Graphs and Quasi-Total Graphs. International Journal of Computer Applications. 105, 3 ( November 2014), 12-16. DOI=10.5120/18356-9483

@article{ 10.5120/18356-9483,
author = { Bhavanari Satyanarayana, Devanaboina Srinivasulu, Kuncham Syam Prasad },
title = { Line Graphs and Quasi-Total Graphs },
journal = { International Journal of Computer Applications },
issue_date = { November 2014 },
volume = { 105 },
number = { 3 },
month = { November },
year = { 2014 },
issn = { 0975-8887 },
pages = { 12-16 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume105/number3/18356-9483/ },
doi = { 10.5120/18356-9483 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:36:43.366499+05:30
%A Bhavanari Satyanarayana
%A Devanaboina Srinivasulu
%A Kuncham Syam Prasad
%T Line Graphs and Quasi-Total Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 105
%N 3
%P 12-16
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The line graph, 1-quasitotal graph and 2-quasitotal graph are well-known. It is proved that if G is a graph consist of exactly m connected components Gi, 1 ? i ? m, then L(G) = L(G1) Å L(G2) Å … Å L(Gm) where L(G) denotes the line graph of G, and 'Å' denotes the ring sum operation on graphs. The number of connected components in G is equal to the number of connected components in L(G) and also if G is a cycle of length n, then L(G) is also a cycle of length n. The concept of 1-quasitotal graph is introduced and obtained that Q1(G) = G Å L(G) where Q1(G) denotes 1-quasitotal graph of a given graph G. It is also proved that for a 2-quasitotal graph of G, the two conditions (i) |E(G)|= 1; and (ii) Q2(G) contains unique triangle are equivalent.

References
  1. Bondy J. A. and Murty U. S. R. "Graph Theory with Applications", The Macmillan Press Ltd, (1976).
  2. Harary F. "Graph Theory", Addison-Wesley Publishing Company, USA (1972).
  3. Narsing Deo "Graph Theory with Applications to Engineering and Computer Science", Prentice Hall of India Pvt. Ltd, New Delhi (1997).
  4. Armugam S. & Ramachandran S. "Invitation to Graph Theory", Scitech Publications (India) Pvt. Ltd, Chennai, (2001).
  5. Kulli V. R. "Minimally Non outerplanar Graphs: A survey", (in the Book: "Recent Studies in Graph theory" ed: V. R. Kulli), Vishwa International Publication, (1989) 177-189.
  6. Satyanarayana Bh. and Syam Prasad K. "An Isomorphism Theorem on Directed Hypercubes of Dimension n", Indian J. Pure & Appl. Math 34 (10) (2003) 1453-1457.
  7. Satyanarayana Bh. and Syam Prasad K. "Discrete Mathematics and Graph Theory", Prentice Hall India Pvt. Ltd. , ISBN 978-81-203-3842-5 (2009).
  8. Satyanarayana Bh. and Syam Prasad K. "Nearrings, Fuzzy Ideals and Graph Theory" CRC Press (Taylor & Francis Group, London, New York), 2013 ISBN 13: 9781439873106.
  9. Satyanarayana Bh. , Srinivasulu D. , and Syam Prasad K. "Some Results on Degree of Vertices in Semitotal Block Graph and Total – Block Graph", International Journal of Computer Applications (0975 - 8887) Vol. 50, No. 9, (July 2012) 19-22.
Index Terms

Computer Science
Information Sciences

Keywords

Line graph quasi total graph connected component.