Skip to main content
SpringerLink
Log in

Repetition of Spectral Radiuses Among Connected Induced Subgraphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A connected graph G is spectrally non-redundant if the spectral radiuses of the connected induced subgraphs of G are all different. As observed by Fernandes, Júdice, and Trevisan (2017), for such graphs the number of connected induced subgraphs is equal to the number of complementarity eigenvalues. This note is an attempt at quantifying the so-called spectral redundancy phenomenon. Such a phenomenon occurs when there is a substantial amount of repetition among the spectral radiuses of the connected induced subgraphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Adly, S., Rammal, H.: A new method for solving Pareto eigenvalue complementarity problems. Comput. Optim. Appl. 55, 703–731 (2013)

    Article  MathSciNet  Google Scholar 

  2. Adly, S., Seeger, A.: A nonsmooth algorithm for cone-constrained eigenvalue problems. Comput. Optim. Appl. 49, 299–318 (2011)

    Article  MathSciNet  Google Scholar 

  3. Alon, N., Bollobás, B.: Graphs with a small number of distinct induced subgraphs. Discrete Math. 75, 23–30 (1989)

    Article  MathSciNet  Google Scholar 

  4. Erdös, P.: An asymptotic inequality in the theory of numbers. Vestnik Leningrad. Univ. 15, 41–49 (1960). (Russian)

    MathSciNet  MATH  Google Scholar 

  5. Fernandes, L., Júdice, J., Sherali, H., Fukushima, M.: On the computation of all eigenvalues for the eigenvalue complementarity problem. J. Global Optim. 59, 307–326 (2014)

    Article  MathSciNet  Google Scholar 

  6. Fernandes, R., Júdice, J., Trevisan, V.: Complementarity eigenvalue of graphs. Linear Algebra Appl. 527, 216–231 (2017)

    Article  MathSciNet  Google Scholar 

  7. Ford, K.: The distribution of integers with a divisor in a given interval. Ann. Math. 168, 367–433 (2008)

    Article  MathSciNet  Google Scholar 

  8. Harary, F., Palmer, E.M.: Graphical Enumeration. Academic Press, London (1973)

    MATH  Google Scholar 

  9. Lepović, M., Gutman, I.: Some spectral properties of starlike trees. Bull. Cl. Sci. Math. Nat. Sci. Math. 122, 107–113 (2001)

    MathSciNet  MATH  Google Scholar 

  10. Pinto da Costa, A., Seeger, A.: Cone-constrained eigenvalue problems: theory and algorithms. Comput. Optim. Appl. 45, 25–57 (2010)

    Article  MathSciNet  Google Scholar 

  11. Pinheiro, L.K., Souza, B.S., Trevisan, V.: Determining graphs by the complementary spectrum. Discrete Math. Graph Theory 40, 607–620 (2020)

    Article  Google Scholar 

  12. Schwenk, A.: Computing the characteristic polynomial of a graph. Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973), pp. 153–172. Lecture Notes in Math., vol. 406. Springer, Berlin (1974)

  13. Seeger, A.: Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions. Linear Algebra Appl. 292, 1–14 (1999)

    Article  MathSciNet  Google Scholar 

  14. Seeger, A.: Complementarity eigenvalue analysis of connected graphs. Linear Algebra Appl. 543, 205–225 (2018)

    Article  MathSciNet  Google Scholar 

  15. Seeger, A., Sossa, D.: Extremal problems involving the two largest complementarity eigenvalues of a graph. Graphs Combin. (2019). https://doi.org/10.1007/s00373-019-02112-4

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Avignon, 33 Rue Louis Pasteur, 84000, Avignon, France

    Alberto Seeger

Authors
  1. Alberto Seeger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alberto Seeger.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Seeger, A. Repetition of Spectral Radiuses Among Connected Induced Subgraphs. Graphs and Combinatorics 36, 1131–1144 (2020). https://doi.org/10.1007/s00373-020-02173-w

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02173-w

Keywords

Mathematics Subject Classification

Search

Navigation