6598 search results - page 112 / 1320 » Graph Theory with Applications |
129
click to vote
DM
2010
15 years 4 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
136
click to vote
DM
2008
15 years 4 months ago
2008
Ore presented a degree condition involving every pair of nonadjacent vertices for a graph to be hamiltonian. Fan (J. Combin. Theory Ser. B 37 (1984) 221
166
click to vote
APSCC
2009
IEEE
15 years 11 months ago
2009
IEEE
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access righ...
146
click to vote
SIGIR
2006
ACM
15 years 10 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
167
click to vote
DM
2006
15 years 4 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...