eigenvalues of edge regular graphs

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

In graph theory, an edge regular graph is defined as follows. Let G = (V,E) be a regular graph with v vertices and degree k. G is said to be edge regular if there is also integer λ such that:

Every two adjacent vertices have λ common neighbors.

A graph of this kind is sometimes said to be an er(v,k,λ).

I want know about eigenvalues of edge regular graph, how can we find eigenvalue of this graph?

-

It is clear that one eigenvalue is k.  I would not expect that the parameters (v,k,λ) alone determine the other eigenvalues. – Tsuyoshi Ito Aug 23 2010 at 11:41

2 Answers

In the event that every non adjacent pair has a fixed number $\mu$ of common neighbors this is a strongly regular graph srg$(v,k,\lambda,\mu)$ for which the 3 distinct eigenvalues and their multiplicities are known: http://en.wikipedia.org/wiki/Strongly_regular_graph (in this case the graph is diameter 2 or a disjoint union of isomorphic complete graphs.) An erg with k=2 and $\lambda=0$ is a disjoint union of cycles (none of length 3) and could have a wide range of eigenvalues. If you want connected then with v=12 k=3 and $\lambda=0$ you could have a wide variety of graphs obtained by connecting each point to three others without creating triangles (such as the skeleton of a dodecahedron, or of a hexagonal prism) all would have 3 as the unique largest eigenvalue but the rest of the spectrum could be many things.

-

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

For the special case when every two non-adjacent vertices have exactly c1 or c2 neighbours, there are some eigenvalue bounds in my paper:

http://www.tandfonline.com/doi/abs/10.1080/03081080600867210

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 4, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9273307919502258, "perplexity_flag": "head"}