IJPAM: Volume 108, No. 3 (2016)
Department of Mathematics
University of Calicut
Malappuram (District), PIN 673 635, Kerala, INDIA
Abstract. A simple graph is said to be if for any two distinct vertices and of , one of the following conditions hold:
- At least one of and is isolated
- There exist two edges and of such that is incident with but not with and is incident with but not with .
In this paper we discuss graphs and some examples of it. This paper also deals with the sufficient conditions for join of two graphs, middle graph of a graph and corona of two graphs to be . It proved that line graph of any graph is . Moreover, the relations between graphs with its incidence matrix and its adjacency matrix is discussed.
Received: December 4, 2016
AMS Subject Classification: 05C99
Key Words and Phrases: graph, incidence matrix, adjacency matrix, line graph, corona, middle graph
Download paper from here.
DOI: 10.12732/ijpam.v108i3.9 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 581 - 589
GRAPHS%22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar; DOI (International DOI Foundation); WorldCAT.