loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
The structure of super line graphs.
Las Vegas, Nevada, USA
December 07-December 09
ISBN: 0-7695-2509-1
ASCII Text
x 
 
Jay Bagga, Daniela Ferrero, Robert Ellis, "The structure of super line graphs.," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 468-471, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2005.84,
author = {Jay Bagga and Daniela Ferrero and Robert Ellis},
title = {The structure of super line graphs.},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2005},
issn = {1087-4089},
pages = {468-471},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2005.84},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - The structure of super line graphs.
SN - 1087-4089
SP468
EP471
A1 - Jay Bagga,
A1 - Daniela Ferrero,
A1 - Robert Ellis,
PY - 2005
KW - null
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Jay Bagga, Ball State University
Daniela Ferrero, Texas State University

For a given graph G = (V,E) and a positive integer k, the super line graph of index k of G is the graph Sk(G) which has for vertices all the k-subsets of E(G), and two vertices S and T are adjacent whenever there exist s \varepsilon S and t \varepsilon T such that s and t share a common vertex. In the super line multigraph Lk(G) we have an adjacency for each such occurrence.

We give a formula to find the adjacency matrix of L_k(G). If G is a regular graph, we calculate all the eigenvalues of L_k(G) and their multiplicities. From those results we give an upper bound on the number of isolated vertices.

Citation:
Jay Bagga, Daniela Ferrero, Robert Ellis, "The structure of super line graphs.," ispan, pp.468-471, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.