7 Result(s)
-
Article
A Coalitional Power Value for Set Games
We propose the concept of a coalitional power value for set games, and present its axiomatic characterization of global effciency, equal treatment property and coalitional power monotonicity. The coalitional p...
-
Article
Vertex partitions of r-edge-colored graphs
Let G be an edge-colored graph. The monochromatic tree partition problem is to find the minimum number of vertex disjoint monochromatic trees to cover the all vertices of G. In the authors’ previous work, it has ...
-
Article
Partitioning complete graphs by heterochromatic trees
A heterochromatic tree is an edge-colored tree in which any two edges have different colors. The heterochromatic tree partition number of an r-edge-colored graph G, denoted by t ...
-
Article
Upper bound involving parameter σ 2 for the rainbow connection number
Let G be a connected graph of order n. The rainbow connection number rc(G) of G was introduced by Chartrand et al. Chandran et al. used the minimum degree δ of G and obtained an upper bound that rc(G) ≤ 3n/(δ +1)...
-
Article
Rainbow k-connectivity of Random Bipartite Graphs
A path in an edge-colored graph G is called a rainbow path if no two edges of the path are colored the same color. The minimum number of colors required to color the edges of G such that every pair of vertices ar...
-
Article
Hypergraph Turán Numbers of Vertex Disjoint Cycles
The Turán number of a k-uniform hypergraph H, denoted by exk(n;H), is the maximum number of edges in any k-uniform hypergraph F on n vertices which does not contain H as a subgraph. Let
-
Article
Rainbow Pancyclicity in a Collection of Graphs Under the Dirac-type Condition
Let G = {Gi: i ∈ [n]} be a collection of not necessarily distinct n-vertex graphs with the same vertex set V, where G can be seen as an edge-colored (multi)graph and each Gi is the set of edges with color i. A gr...
