Results 1 to 10 of about 22,888 (290)
The study of a mixed graph and its Laplacian matrix have gained quite a bit of interest among the researchers. Mixed graphs are very important for the study of graph theory as they provide a setup where one can have directed and undirected edges in the ...
R B Bapat, Sukanta Pati
exaly +3 more sources
The outflow ranking method for weighted directed graphs [PDF]
A ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this paper we axiomatize the ranking method that ranks the nodes according to their outflow using four independent axioms.
René Van Den Brink, Robert P Gilles
exaly +8 more sources
Cheeger Inequalities for General Edge-Weighted Directed Graphs [PDF]
We consider Cheeger Inequalities for general edge-weighted directed graphs. Previously the directed case was considered by Chung for a probability transition matrix corresponding to a strongly connected graph with weights induced by a stationary ...
T -H Hubert Chan +2 more
exaly +4 more sources
Adjasankey: Visualization of Huge Hierarchical Weighted and Directed Graphs [PDF]
International audienceVisualization of hierarchical weighted and directed graphs are usually done with node-link or adjacency matrix diagrams. However, these representations suffer from various drawbacks: low readability in a context of Big Data, high ...
Joris Sansen +2 more
exaly +4 more sources
Weighted Consensus Problem for Multiagent Systems with Edge- and Node-Weighted Directed Graphs
In this paper, the concept of consensus is generalized to weighted consensus, by which the conventional consensus, the bipartite consensus, and the cluster consensus problems can be unified in the proposed weighted consensus frame. The dynamics of agents
Lixin Gao, Hui Fang, Wenhai Chen, He Cao
doaj +3 more sources
On the Graph Isomorphism Completeness of Directed and Multidirected Graphs
The category of directed graphs is isomorphic to a particular category whose objects are labeled undirected bipartite graphs and whose morphisms are undirected graph morphisms that respect the labeling. Based on this isomorphism, we begin by showing that
Sebastian Pardo-Guerra +2 more
doaj +2 more sources
Drawing Large Weighted Graphs Using Clustered Force-Directed Algorithm [PDF]
© 2014 IEEE. Clustered graph drawing is widely considered as a good method to overcome the scalability problem when visualizing large (or huge) graphs. Force-directed algorithm is a popular approach for laying graphs yet small to medium size datasets due
Jie Hua +2 more
exaly +2 more sources
Extension of m-isometric weighted composition operators on directed graphs
In this paper, we discuss k-quasi-m-isometric composition operators and weighted composition operators on directed graphs with one circuit and more than one branching ...
T Prasad, Prasad T
exaly +2 more sources
This paper investigates the global connectivity of complex networks with random links. An expected communication graph with weighted edges is used to model the network.
Hamid Mahboubi +3 more
doaj +1 more source
A Node Differential Privacy-Based Method to Preserve Directed Graphs in Wireless Mobile Networks
With the widespread popularity of Wireless Mobile Networks (WMNs) in our daily life, the huge risk to disclose personal privacy of massive graph structure data in WMNs receives more and more attention.
Jun Yan, Yihui Zhou, Laifeng Lu
doaj +1 more source

