3267 search results - page 54 / 654 » Generalized quasirandom graphs |
WG
2004
Springer
15 years 4 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
106
click to vote
COCOA
2008
Springer
15 years 26 days ago
2008
Springer
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
AMC
2008
14 years 11 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
DM
2008
14 years 11 months ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...