44 search results - page 5 / 9 » (p, 1)-Total labelling of graphs |
166
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
136
click to vote
DM
2008
15 years 6 months ago
2008
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
125
click to vote
DM
2010
15 years 6 months ago
2010
An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection : V (G)E(G) [n+e], where, for every edge uv E(G), we have wt(uv) = k, the magic sum...
137
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
176
click to vote
MCS
2010
Springer
15 years 8 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...