1729 search results - page 52 / 346 » Bound Graph Polysemy |
137
Voted
CSR
2008
Springer
15 years 6 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
145
click to vote
ARSCOM
2006
15 years 4 months ago
2006
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
124
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
127
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
155
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...