Skip to main content
Log in

Maximal and extremal singular graphs

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

A graph G is singular if the nullspace of its adjacency matrix is nontrivial. Such a graph contains induced subgraphs called singular configurations of nullity 1. We present two algorithms. One is for the construction of a maximal singular nontrivial graph G containing an induced subgraph, which is a singular configuration with the support of a vector in its nullspace as in that of G. The second is for the construction of a nut graph, a graph of nullity one whose null vector has no zero entries. An extremal singular graph of a given order, with the maximal nullity and support, has a nut graph as a maximal singular configuration.

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.

Similar content being viewed by others

References

  1. P. W. Fowler, B. T. Pickup, T. Z. Todorova, and T. Pisanski, “Fragment analysis of singlemolecule conduction,” J. Chem. Phys., 130, 174708, 1–11 (2009).

    Google Scholar 

  2. A. Kotlov and L. Lov´asz, “The rank and size of graphs,” J. Graph Theory, 23, 185–189 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Nath and B. K. Sarma, “Minimal configuration unicyclic graphs,” Lin. Multilin. Algebra, 57, No. 1, 19–27 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  4. J. W. Sander and T. Sander, “On the eigenvalues of distance powers of circuits,” Lin. Algebra Appl., 432, 3132-3140 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  5. A. J. Schwenk and R. J. Wilson, “On the eigenvalues of a graph,” in: Selected Topics in Graph Theory (L. W. Beineke and R. J. Wilson, eds.), Academic Press (1978) pp. 307–336.

  6. I. Sciriha, “On the construction of graphs of nullity one,” Discr. Math., 181, 193–211 (1998).

    Article  MathSciNet  MATH  Google Scholar 

  7. I. Sciriha, “On singular line graphs of trees,” Congr. Numer., 135, 73–91 (1998).

    MathSciNet  MATH  Google Scholar 

  8. I. Sciriha, “A characterization of singular graphs,” Electron. J. Algebra, 16, 451–462 (2007).

    MathSciNet  MATH  Google Scholar 

  9. I. Sciriha, “Extremal Nonbonding orbitals,” Math. Comput. Chem., 63, No. 3, 751–768 (2010).

    MathSciNet  Google Scholar 

  10. I. Sciriha, S. Fiorini, and J. Lauri, “A minimal basis for a vector space,” Graph Theory Notes of New York, 31, 21-24 (1996).

    MathSciNet  Google Scholar 

  11. I. Sciriha and P. W. Fowler, “On nut and core singular fullerenes,” Discr. Math., 308, 267–276 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  12. I. Sciriha and I. Gutman, “Nut graphs—Maximally extending cores,” Utilitas Math., 54, 257–272 (1998).

    MathSciNet  MATH  Google Scholar 

  13. I. Sciriha and I. Gutman, “Minimal configuration trees,” Lin. Multilin. Algebra, 54, No. 2, 141–145 (2006).

    Article  MathSciNet  MATH  Google Scholar 

  14. G. Wang, F. Zhu, and H. Bian, “Note on the nullity of bicyclic graphs,” Ars Combin. 91, 129–134 (2009).

    MathSciNet  MATH  Google Scholar 

  15. T. Xuezhongand and B. Liu, “On the nullity of unicyclic graphs,” Lin. Algebra Appl. 408, 212–220 (2005).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Irene Sciriha.

Additional information

Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 71, Algebraic Techniques in Graph Theory and Optimization, 2011.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sciriha, I. Maximal and extremal singular graphs. J Math Sci 182, 117–125 (2012). https://doi.org/10.1007/s10958-012-0733-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-012-0733-3

Keywords

Navigation