Skip to main content

A note concerning Acharya’s conjecture on a spectral measure of structural balance in a social system

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover Combinatorics and Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 885))

  • 1117 Accesses

Abstract

In this note, we establish a theorem concerning the common polynomials of the cospectral classes of signed graphs on a given graph in which all the cycles are of the same length and pass through a single point. This theorem is observed to give a doubly infinite class of graphs serving as counterexamples to a recent conjecture on a certain number associated with a cospectral class of unbalanced signed graphs on a given graph.

This work was done when the author was at Mehta Research Institute of Mathematics and Mathematical Physics, Allahabad.

The research partially supported by Department of Atomic Energy, Bombay.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. D. Acharya, A spectral criterion for cycle-balance in networks and its consequences, J. Graph Theory, 3(4) (1979).

    Google Scholar 

  2. D. Cartwright and F. Harary, Structural balance: A generalization of Heider’s theory, Psych. Rev., 63(1956), 277–293.

    Article  Google Scholar 

  3. G.T. Chartrand, Graphs as mathematical models, Prindle, Weber and Schmidt(S), Inc., Boston, Mass., 1977.

    MATH  Google Scholar 

  4. M.K. Mill and B.D. Acharya, A recurrence formula for computing the characteristic polynomial of a sigraph, J. Comb. Infor. Sys. Sci., 5(1) (1980), 1–5.

    MathSciNet  Google Scholar 

  5. M.K. Gill, The catalogue of sigraphs of orders less than six, their characteristic polynomials and their spectra (under preparation).

    Google Scholar 

  6. F. Harary, On the notion of balance of a signed graph, Mich. Math. Journal, 2(1953), 143–146.

    Article  MathSciNet  MATH  Google Scholar 

  7. F. Harary, R.Z. Norman and D. Cartwright, Structural Models: An Introduction to the Theory of Directed Graphs, Wiley, 1965.

    Google Scholar 

  8. F. Harary, Graph Theory, Addison Wesley, Reading, Mass., 1972.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Siddani Bhaskara Rao

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Gill, M.K. (1981). A note concerning Acharya’s conjecture on a spectral measure of structural balance in a social system. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092269

Download citation

  • DOI: https://doi.org/10.1007/BFb0092269

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

  • Online ISBN: 978-3-540-47037-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics