No abstract

Using dimensionality reduction idea to visualize graph data sets can preserve the properties of the original space and reveal the underlying information shared among data points. Continuity Trustworthy Graph Embedding (CTGE) is new method we have introduced in this paper to improve the faithfulness of the graph visualization. We will use CTGE in graph field to find new understandable representation to be more easy to analyze and study. Several experiments on real graph data sets are applied to test the effectiveness and efficiency of the proposed method, which showed CTGE generates highly faithfulness graph representation when compared its representation with other methods.

No abstract

The two questions that: how many edges at least have to be added to the network to ensure the message within the effective bounds, and how large message delay will be increased when faults occur, can re-write this problem as: What the minimum diameter of a connected graph obtained from a graph of diameter after adding extra edges, this problem called "Edge Addition Problem". In this paper we find some exact values to above problem by using some special graphs (Line Graph, Bipartite graph, and complete Bipartite graph).

No abstract