IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/d3b7fa76-22b5-4a9a-8706-a88dd14d69a9.html
   My bibliography  Save this paper

Graphs whose normalized laplacian has three eigenvalues

Author

Listed:
  • van Dam, E.R.

    (Tilburg University, School of Economics and Management)

  • Omidi, G.R.

Abstract

No abstract is available for this item.

Suggested Citation

  • van Dam, E.R. & Omidi, G.R., 2011. "Graphs whose normalized laplacian has three eigenvalues," Other publications TiSEM d3b7fa76-22b5-4a9a-8706-a, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:d3b7fa76-22b5-4a9a-8706-a88dd14d69a9
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/1357965/dam_4.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. van Dam, E.R. & Haemers, W.H., 2007. "Developments on Spectral Characterizations of Graphs," Discussion Paper 2007-33, Tilburg University, Center for Economic Research.
    2. van Dam, E.R. & Spence, E., 1996. "Small Regular Graphs with Four Eigenvalues," Research Memorandum 723, Tilburg University, School of Economics and Management.
    3. van Dam, E.R. & Haemers, W.H., 2002. "Which Graphs are Determined by their Spectrum?," Discussion Paper 2002-66, Tilburg University, Center for Economic Research.
    4. van Dam, E.R., 1994. "Regular graphs with four eigenvalues," Research Memorandum FEW 659, Tilburg University, School of Economics and Management.
    5. van Dam, E.R. & Haemers, W.H., 1998. "Graphs with constant mu and mu-bar," Other publications TiSEM 3cba5bf4-ad2f-465d-a9a2-a, Tilburg University, School of Economics and Management.
    6. van Dam, E.R., 1997. "Nonregular Graphs with Three Eigenvalues," Research Memorandum 746, Tilburg University, School of Economics and Management.
    7. van Dam, E.R. & de Caen, D. & Spence, E., 1999. "A nonregular analogue of conference graphs," Other publications TiSEM 2354d510-0aeb-4504-917d-5, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. B. R. Rakshith, 2022. "Signless Laplacian spectral characterization of some disjoint union of graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 53(1), pages 233-245, March.
    2. Huang, Jing & Li, Shuchao, 2018. "The normalized Laplacians on both k-triangle graph and k-quadrilateral graph with their applications," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 213-225.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Haemers, W.H. & Omidi, G.R., 2010. "Universal Adjacency Matrices with Two Eigenvalues," Discussion Paper 2010-119, Tilburg University, Center for Economic Research.
    2. Haemers, W.H. & Omidi, G.R., 2010. "Universal Adjacency Matrices with Two Eigenvalues," Other publications TiSEM 932a73a8-9fae-44ec-9ce5-7, Tilburg University, School of Economics and Management.
    3. van Dam, E.R. & Spence, E., 2003. "Combinatorial Designs with Two Singular Values I. Uniform Multiplicative Designs," Discussion Paper 2003-67, Tilburg University, Center for Economic Research.
    4. van Dam, E.R. & Haemers, W.H., 2002. "Which Graphs are Determined by their Spectrum?," Discussion Paper 2002-66, Tilburg University, Center for Economic Research.
    5. van Dam, E.R. & Spence, E., 2003. "Combinatorial Designs with Two Singular Values I. Uniform Multiplicative Designs," Other publications TiSEM 87fabd1b-6be0-4f99-b7a8-5, Tilburg University, School of Economics and Management.
    6. van Dam, E.R. & Spence, E., 2003. "Combinatorial Designs with Two Singular Values II. Partial Geometric Designs," Discussion Paper 2003-94, Tilburg University, Center for Economic Research.
    7. van Dam, E.R. & Haemers, W.H., 2002. "Which Graphs are Determined by their Spectrum?," Other publications TiSEM f163dbe4-3669-4a99-bc19-7, Tilburg University, School of Economics and Management.
    8. van Dam, E.R. & Spence, E., 2003. "Combinatorial Designs with Two Singular Values II. Partial Geometric Designs," Other publications TiSEM fec47f57-9bec-453d-8275-8, Tilburg University, School of Economics and Management.
    9. Estrada, Ernesto, 2007. "Graphs (networks) with golden spectral ratio," Chaos, Solitons & Fractals, Elsevier, vol. 33(4), pages 1168-1182.
    10. van Dam, E.R. & Haemers, W.H., 2010. "An Odd Characterization of the Generalized Odd Graphs," Other publications TiSEM 2478f418-ae83-4ac3-8742-2, Tilburg University, School of Economics and Management.
    11. van Dam, E.R. & Haemers, W.H., 2010. "An Odd Characterization of the Generalized Odd Graphs," Discussion Paper 2010-47, Tilburg University, Center for Economic Research.
    12. van Dam, E.R. & de Caen, D. & Spence, E., 1999. "A nonregular analogue of conference graphs," Other publications TiSEM 2354d510-0aeb-4504-917d-5, Tilburg University, School of Economics and Management.
    13. Xiaoyun Yang & Ligong Wang, 2020. "Laplacian Spectral Characterization of (Broken) Dandelion Graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(3), pages 915-933, September.
    14. Haemers, W.H., 2005. "Matrices and Graphs," Other publications TiSEM 94b6bd28-71e7-41d3-b978-c, Tilburg University, School of Economics and Management.
    15. B. R. Rakshith, 2022. "Signless Laplacian spectral characterization of some disjoint union of graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 53(1), pages 233-245, March.
    16. Haemers, W.H. & Ramezani, F., 2009. "Graphs Cospectral with Kneser Graphs," Discussion Paper 2009-76, Tilburg University, Center for Economic Research.
    17. Al-Yakoob, Salem & Kanso, Ali & Stevanović, Dragan, 2022. "On Hosoya’s dormants and sprouts," Applied Mathematics and Computation, Elsevier, vol. 430(C).
    18. van Dam, E.R., 1998. "Bounds on special subsets in graphs, eigenvalues and association schemes," Other publications TiSEM e9bcdd9f-2de0-4750-9ea2-c, Tilburg University, School of Economics and Management.
    19. Haemers, W.H. & Kharaghani, H. & Meulenberg, M.A., 2010. "Divisible Design Graphs," Discussion Paper 2010-19, Tilburg University, Center for Economic Research.
    20. Yuan, Bo-Jun & Wang, Yi & Xu, Jing, 2020. "Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their H-spectra," Applied Mathematics and Computation, Elsevier, vol. 380(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tiu:tiutis:d3b7fa76-22b5-4a9a-8706-a88dd14d69a9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.