Log in

Relevant bibliographies by topics / Graph / Books

Books on the topic 'Graph'

To see the other types of publications on this topic, follow the link: Graph.

Author: Grafiati

Published: 4 June 2021

Last updated: 7 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 books for your research on the topic 'Graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

Golumbic, M. C. Algorithmic graph theory and perfect graphs. 2nd ed. Amsterdam: North Holland, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bollobás, Béla. Random graphs. London: Academic Press, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kolchin, V. F. Random graphs. Cambridge, UK: Cambridge University Press, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Random graphs. 2nd ed. Cambridge: Cambridge University Press, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Random geometric graphs. Oxford: Oxford University Press, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bonato, Anthony. The game of cops and robbers on graphs. Providence, R.I: American Mathematical Society, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Golumbic, Martin Charles. Algorithmic graph theory and perfect graphs. Amsterdam: Elsevier, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Graph it: Reading charts and graphs. New York: PowerKids Press, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Graph attack!: Understanding charts and graphs. Englewood Cliffs, NJ: Cambridge Adult Education, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bader, David, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner, eds. Graph Partitioning and Graph Clustering. Providence, Rhode Island: American Mathematical Society, 2013. http://dx.doi.org/10.1090/conm/588.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Evstigneev, V. A. Teorii͡a︡ grafov: Algoritmy obrabotki beskonturnykh grafov. Novosibirsk: "Nauka," Sibirskoe predprii͡a︡tie RAN, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

Kyōto Daigaku. Sūri Kaiseki Kenkyūjo., ed. Graph equation for line graphs and m-step graphs. Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

Reinschke, K. J. Multivariable control: A graph-theoretic approach. Berlin: Springer-Verlag, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

14

Reinschke, K. J. Multivariable Control: A graph-theoretic approach. Berlin: Akademie-Verlag, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

15

1949-, Hahn Geňa, and Sabidussi Gert, eds. Graph symmetry: Algebraic methods and applications. Dordrecht: Kluwer Academic Publishers, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

Introduction to graph theory. 2nd ed. Upper Saddle River, N.J: Prentice Hall, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

17

West, Douglas Brent. Introduction to graph theory. Upper Saddle River, NJ: Prentice Hall, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

18

Large networks and graph limits. Providence, Rhode Island: American Mathematical Society, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

19

J, Sheehan, ed. The Petersen graph. Cambridge [England]: Cambridge University Press, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

20

Chartrand, Gary. Chromatic graph theory. Boca Raton: Chapman & Hall/CRC, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

21

O'Connell, Neil. Some large deviation results for sparse random graphs. Bristol [England]: Hewlett Packard, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

22

Giuseppe, Di Battista, ed. Graph drawing: Algorithms for the visualization of graphs. Upper Saddle River, N.J: Prentice Hall, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

23

Durrett, Rick. Random Graph Dynamics. Cambridge University Press, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

24

Durrett, Rick. Random Graph Dynamics. Cambridge University Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

25

Durrett, Rick. Random Graph Dynamics. Cambridge University Press, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

26

Durrett, Rick. Random Graph Dynamics. Cambridge University Press, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

27

Golumbic, Martin Charles, and Werner Rheinboldt. Algorithmic Graph Theory and Perfect Graphs. Elsevier Science & Technology Books, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

28

Graph It! Making Line Graphs. Gareth Stevens Publishing, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

Coolen, A. C. C., A. Annibale, and E. S. Roberts. Soft constraints: exponential random graph models. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0004.

Full text

Abstract:

Exponential random graph models (ERGMs) provide conceptually elegant recipes for generating soft-constrained random graphs. This chapter begins by explaining the theory and describing how to properly specify an ERGM, including demonstrating Lagrange’s method to derive the values of the model parameters that correspond to the desired constraints. Three ERGMs, all with constraints depending linearly on the adjacency matrix, are solved exactly: the targeted total number of links, targeted individual node degrees and targeted number of two-way links in a directed graph. However, when the controlled features become more complicated, ERGMs have a tendency to produce graphs in extreme phases (very dense or very sparse). The two-star model and the Strauss model are worked through in detail using advanced techniques from statistical mechanics in order to analyze the phase transitions. The chapter closes with a discussion of the strengths and weaknesses of ERGMs as null models.

APA, Harvard, Vancouver, ISO, and other styles

30

Kolchin, V. F. Random Graphs. Cambridge University Press, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

31

Kolchin, V. F. Random Graphs. Cambridge University Press, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

32

Penrose, Mathew. Random Geometric Graphs. Oxford University Press, Incorporated, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

33

Sobieczky, Florian. Unimodularity in Randomly Generated Graphs. American Mathematical Society, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

34

Choi, In-kyeong. On straight line representations of random planar graphs. 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

35

Kolchin, V. F. Random Graphs. Cambridge University Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

36

Graphs, Math. Math Graph: Graph Paper. Independently Published, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

37

Golumbic, Martin Charles. Algorithmic Graph Theory and Perfect Graphs. Elsevier Science & Technology Books, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

38

Algorithmic Graph Theory and Perfect Graphs. Elsevier, 2004. http://dx.doi.org/10.1016/s0167-5060(04)x8001-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Warner, Jack. Graph Attack: Understanding Charts and Graphs. Prentice Hall, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

40

Gosman, Gillian. Graph It: Reading Charts and Graphs. Rosen Publishing Group, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

41

NA. Precalculus Functn & Graphs& Graph Calc Pkg. Addison Wesley Publishing Company, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

42

Warner, Jack. Graph Attack: Understanding Charts and Graphs. Prentice Hall, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

Designs, Plan B. Graph Paper: Graph Paper 4x4. Independently Published, 2018.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

44

Pie, Sweetie. Graph Paper: Valves Graph Paper. Playful Publishing LLC, 2022.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

45

SANGWONGVANICH, Prathed. Graph Notebooke: Graph Paper Hexagonal. Independently Published, 2019.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

46

Publishing, Mmlt. Graph Path: Graph Paper Notebook. Independently Published, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

47

Jay, Mary. Graph Paper Composition: Graph Paper. Independently Published, 2019.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

48

GB, Zack. Graph Paper: Graph Composition Book. Independently Published, 2019.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

49

Graph Book: 8x8 Graph Paper. Independently Published, 2021.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

50

MICHAEL, John. Graph Paper Composition: Graph Book. Independently Published, 2019.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!