Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … ,...
Petros A. Petrosyan, Ani Shashikyan, Arman Yu. Tor...
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...