Approximating the isoperimetric number of strongly regular graphs.
Sivasubramanian, Sivaramakrishnan
ELA. The Electronic Journal of Linear Algebra [electronic only] (2005)
- Volume: 13, page 111-121
- ISSN: 1081-3810
Access Full Article
top
How to cite
topSivasubramanian, Sivaramakrishnan. "Approximating the isoperimetric number of strongly regular graphs.." ELA. The Electronic Journal of Linear Algebra [electronic only] 13 (2005): 111-121. <http://eudml.org/doc/126067>.
@article{Sivasubramanian2005,
author = {Sivasubramanian, Sivaramakrishnan},
journal = {ELA. The Electronic Journal of Linear Algebra [electronic only]},
keywords = {combinatorial Laplacian; eigenvalue},
language = {eng},
pages = {111-121},
publisher = {ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy},
title = {Approximating the isoperimetric number of strongly regular graphs.},
url = {http://eudml.org/doc/126067},
volume = {13},
year = {2005},
}
TY - JOUR
AU - Sivasubramanian, Sivaramakrishnan
TI - Approximating the isoperimetric number of strongly regular graphs.
JO - ELA. The Electronic Journal of Linear Algebra [electronic only]
PY - 2005
PB - ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy
VL - 13
SP - 111
EP - 121
LA - eng
KW - combinatorial Laplacian; eigenvalue
UR - http://eudml.org/doc/126067
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.