Skip to main content
Log in

Characterization of digraphs with three complementarity eigenvalues

  • Published:
Journal of Algebraic Combinatorics Aims and scope Submit manuscript

Abstract

Given a digraph D, the complementarity spectrum of the digraph is defined as the set of complementarity eigenvalues of its adjacency matrix. This complementarity spectrum has been shown to be useful in several fields, particularly in spectral graph theory. The differences between the properties of the complementarity spectrum for (undirected) graphs and for digraphs make the study of the latter of particular interest, and characterizing strongly connected digraphs with a small number of complementarity eigenvalues is a nontrivial problem. Recently, strongly connected digraphs with one and two complementarity eigenvalues have been completely characterized. In this paper, we study strongly connected digraphs with exactly three elements in the complementarity spectrum, ending with a complete characterization. This leads to a structural characterization of general digraphs having three complementarity eigenvalues.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22

Similar content being viewed by others

Data availability

Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.

Notes

  1. Also referred as complementary eigenvalues.

References

  1. Adly, S., Rammal, H.: A new method for solving second-order cone eigenvalue complementarity problems. J. Optim. Theory Appl. 165(2), 563–585 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bravo, D., Cubría, F., Fiori, M., Trevisan, V.: Complementarity spectrum of digraphs. Linear Algebra Appl. 627, 24–40 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York (2012). https://doi.org/10.1007/978-1-4614-1939-6

    Book  MATH  Google Scholar 

  4. Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs: Theory and Applications. Wiley, New York (1998)

    MATH  Google Scholar 

  5. Doob, M.: Graphs with a small number of distinct eigenvalues. Ann. New York Acad. Sci. 175, 104–110 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2007)

    MATH  Google Scholar 

  7. Fernandes, R., Judice, J., Trevisan, V.: Complementary eigenvalues of graphs. Linear Algebra Appl. 527, 216–231 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Math. J. 23(2), 298–305 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lin, H., Shu, J.: A note on the spectral characterization of strongly connected bicyclic digraphs. Linear Algebra Appl. 436(7), 2524–2530 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Olivieri, A., Rada, J., Rios Rodriguez, A.: Digraphs with few eigenvalues. Utilitas Mathematica 96, 89–99 (2015)

    MathSciNet  MATH  Google Scholar 

  11. Pinto da Costa, A., Martins, J., Figueiredo, I., Júdice, J.: The directional instability problem in systems with frictional contacts. Computer Methods Appl. Mech. Eng. 193(3-5), 357–384 (2004)

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

  13. Sachs, H.: Beziehungen zwischen den in einem graphen enthaltenen kreisen und seinem charakteristischen polynom. Publ. Math. Debrecen 11(1), 119–134 (1964)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Von Collatz, L., Sinogowitz, U.: Spektren endlicher grafen. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 21(1), 63–77 (1957). Springer

Download references

Acknowledgements

This research is part of the doctoral studies of F. Cubría. V. Trevisan acknowledges partial support of CNPq Grants 409746/2016-9 and 310827/2020-5, and FAPERGS Grant PqG 17/2551-0001. M. Fiori and D. Bravo acknowledge the financial support provided by ANII, Uruguay. F. Cubría thanks the doctoral scholarship from CAP-UdelaR. We thank Lucía Riera for the help with the figures.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florencia Cubría.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bravo, D., Cubría, F., Fiori, M. et al. Characterization of digraphs with three complementarity eigenvalues. J Algebr Comb 57, 1173–1193 (2023). https://doi.org/10.1007/s10801-023-01218-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10801-023-01218-6

Keywords

Navigation