483 search results - page 29 / 97 » On perfectness of sums of graphs |
120
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
142
click to vote
JCT
2010
15 years 12 days ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
119
click to vote
IPL
2010
15 years 12 days ago
2010
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
129
click to vote
INFOCOM
1997
IEEE
15 years 6 months ago
1997
IEEE
A secret sharing schemefor the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsetsof ...
112
click to vote
DAM
2008
15 years 2 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...