1736 search results - page 109 / 348 » On antimagic directed graphs |
173
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
181
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
117
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
151
click to vote
SIAMCO
2008
15 years 6 months ago
2008
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
188
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...