‎In this paper we give a characterization of unmixed tripartite‎ ‎graphs under certain conditions which is a generalization of a‎ ‎result of Villarreal on bipartite graphs‎. ‎For bipartite graphs two‎ ‎different characterizations were given by Ravindra and Villarreal‎. ‎We show that these two characterizations imply each other‎.

In this paper we present a bipartite-network-based resource allocation(BNRA) method to extract and quantify semantic relations from large scale query logs of search engine. Firstly, we construct a queryURL bipartite network from query logs of search engine. By BNRA, we extract asymmetric semantic relations between queries from the bipartite network. Asymmetric relation indicates that two relate...

In the past ten years, community detection in complex networks has attracted more and more attention of researchers. Communities often correspond to functional subunits in the complex systems. In complex network, a node community can be defined as a subgraph induced by a set of nodes, while a link community is a subgraph induced by a set of links. Although most researches pay more attention to ...

‎the concept of the bipartite divisor graph for integer subsets has been considered in [‎m‎. ‎a‎. ‎iranmanesh and c‎. ‎e‎. ‎praeger‎, ‎bipartite divisor graphs for integer subsets‎, ‎{em graphs combin.}‎, ‎{bf 26} (2010) 95--105‎.]‎. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g...

Link prediction problems aim to project future interactions among members in a social network that have not communicated with each other in the past. Classical approaches for link prediction usually use local information, which considers the similarity of two nodes, or structural information such as the immediate neighborhood. However, when using a bipartite graph to represent activity, there i...

Network motifs are small connected subnetworks within a larger network that occur in statistically significant quantities and may indicate functional regions of the network. Network motif software tools employ algorithms that compare a network to randomly generated networks in order to identify subnetworks that occur in frequencies higher than would be expected by random chance. The transcripti...

Abstract Bipartite networks that characterize complex relationships among data arise in various domains. The existing bipartite network models are mainly based on a type of relationship between objects, and cannot effectively describe multiple the real world. In this paper, we propose multi-relationship (MBN) model, which can two types realizes simple weighted reconstruction. Our model contains...

This paper presents the applications of Eigenvalues and Eigenvectors (as part of spectral decomposition) to analyze the bipartivity index of graphs as well as to predict the set of vertices that will constitute the two partitions of graphs that are truly bipartite and those that are close to being bipartite. Though the largest eigenvalue and the corresponding eigenvector (called the principal e...

In a symmetric independent private values setting a sealed-bid double auction dissolves a partnership e¢ciently. This well known result remains valid in a model with interdependent valuations. However, if the interdependent components of valuations are large agents might prefer not to participate in a double auction. Therefore a simple extention of the rules of double-auctions is suggested that...