650 search results - page 9 / 130 » Positive graphs |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
DAM
2010
14 years 9 months ago
2010
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
DM
2008
14 years 9 months ago
2008
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
AVI
2004
14 years 11 months ago
2004
We describe the results of empirical investigations that explore the effectiveness of moving graph diagrams to improve the comprehension of their structure. The investigations inv...
100
click to vote
ISPAN
2008
IEEE
15 years 4 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...