Skip to main content
SpringerLink
Log in

Graph Invariants

  • Reference work entry
  • First Online:
Encyclopedia of Big Data Technologies

  • 68 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 849.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 999.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  • Anthonisse JM (1971) The rush in a directed graph. Technical Report BN 9/71, Mathematical Centre, Amsterdam

    Google Scholar 

  • Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512

    Article  MathSciNet  MATH  Google Scholar 

  • Bavelas A (1948) A mathematical model for group structures. Hum Organ 7:16–30

    Article  Google Scholar 

  • Berge C (1958) Théorie des graphes et ses applications. Dunod, Paris

    MATH  Google Scholar 

  • Berge C (1984) Hypergraphs: combinatorics of finite sets, vol 45. Elsevier, North Holland

    Google Scholar 

  • Boldi P, Vigna S (2014) Axioms for centrality. Internet Math 10(3–4):222–262

    Article  MathSciNet  Google Scholar 

  • Bollobás B (1998) Modern graph theory. Graduate texts in mathematics. Springer, Heidelberg

    Book  MATH  Google Scholar 

  • Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Comput Netw ISDN Syst 30(1):107–117

    Article  Google Scholar 

  • Chakrabarti S, Ester M, Fayyad U, Gehrke J, Han J, Morishita S, Piatetsky-Shapiro G, Wang W (2006) Data mining curriculum: a proposal (version 1.0). In: Intensive working group of ACM SIGKDD curriculum committee, p 140

    Google Scholar 

  • Craswell N, Hawking D, Upstill T (2003) Predicting fame and fortune: PageRank or indegree? In: In Proceedings of the Australasian document computing symposium, ADCS2003, pp 31–40

    Google Scholar 

  • Cvetkovic D, Rowlinson P (2004) Spectral graph theory. In: Beineke LW, Wilson RJ, Cameron PJ (eds) Topics in algebraic graph theory, vol 102. Cambridge University Press, Cambridge, p 88

    MATH  Google Scholar 

  • Diestel R (2012) Graph theory, 4th edn. Graduate texts in mathematics, vol 173. Springer, New York

    Google Scholar 

  • Erdős P, Rényi A (1959) On random graphs, I. Publicationes Mathematicae (Debrecen) 6:290–297

    Google Scholar 

  • Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41

    Article  Google Scholar 

  • Gross JL, Tucker TW (1987) Topological graph theory. Series in discrete mathematics and optimization. Wiley, New York

    Google Scholar 

  • Harris CD (1954) The market as a factor in the localization of industry in the United States. Ann Assoc Am Geogr 44(4):315–348

    Google Scholar 

  • Jin R, Liu L, Aggarwal CC (2011) Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 992–1000

    Google Scholar 

  • Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39–43

    Article  MathSciNet  MATH  Google Scholar 

  • Lovász L (2012) Large networks and graph limits. Colloquium publications, vol 60. American Mathematical Society, Providence

    Google Scholar 

  • Newman M (2003) The structure and function of complex networks. SIAM Rev 45:167–256

    Article  MathSciNet  MATH  Google Scholar 

  • Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford/New York

    Book  MATH  Google Scholar 

  • Vigna S (2016) Spectral ranking. Netw Sci 4(4):433–445

    Article  Google Scholar 

  • Watts D, Strogatz S (1998) Collective dynamics of ‘small-world’ networks. Nature 393(6684):440–442

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Milano, Milano, Italy

    Paolo Boldi

Authors
  1. Paolo Boldi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paolo Boldi .

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Tartu, Tartu, Estonia

    Sherif Sakr

  2. School of Information Technologies, Sydney University, Sydney, Australia

    Albert Y. Zomaya

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Boldi, P. (2019). Graph Invariants. In: Sakr, S., Zomaya, A.Y. (eds) Encyclopedia of Big Data Technologies. Springer, Cham. https://doi.org/10.1007/978-3-319-77525-8_77

Download citation

Publish with us

Policies and ethics

Search

Navigation