PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
size (of a graph) (Definition)

The size of a graph $ G$ is the number of edges in $ G$; it is denoted by $ e(G)$. $ G(n,m)$ denotes an arbitrary graph of order n and size m.

Adapted with permission of the author from Modern Graph Theory by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.



Anyone with an account can edit this entry. Please help improve it!

"size (of a graph)" is owned by mps. [ full author list (2) | owner history (1) ]
(view preamble)

View style:

See Also: graph, order (of a graph), Mantel's theorem

Other names:  size
Log in to rate this entry.
(view current ratings)

Cross-references: order, edges, number, graph
There are 22 references to this entry.

This is version 5 of size (of a graph), born on 2002-03-07, modified 2007-06-01.
Object id is 2761, canonical name is SizeOfAGraph.
Accessed 6330 times total.

Classification:
AMS MSC05C99 (Combinatorics :: Graph theory :: Miscellaneous)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)