1605 search results - page 166 / 321 » On Partitional Labelings of Graphs |
127
Voted
SIAMJO
2008
15 years 19 days ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
101
click to vote
TOMS
2010
14 years 11 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
98
Voted
DM
2008
15 years 24 days ago
2008
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
109
Voted
AIRWEB
2007
Springer
15 years 7 months ago
2007
Springer
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
80
Voted
DAM
2008
15 years 24 days ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...