Results 21 to 30 of about 2,332,619 (281)
Graph Analysis Using Fast Fourier Transform Applied on Grayscale Bitmap Images
Information, 2021 There is spiking interest in graph analysis, mainly sparked by social network analysis done for various purposes. With social network graphs often achieving very large size, there is a need for capable tools to perform such an analysis.
Pawel Baszuro, Jakub Swacha
doaj +1 more source
Towards Inferring Influential Facebook Users
Computers, 2021 Because of the complexity of the actors and the relationships between them, social networks are always represented by graphs. This structure makes it possible to analyze the effectiveness of the network for the social actors who are there.
Suleiman Ali Alsaif +2 more
doaj +1 more source
Equivalence of the filament and overlap graphs of subtrees of limited trees [PDF]
, 2017 The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs.
Enright, Jessica, Stewart, Lorna
core +3 more sources
ISPRS International Journal of Geo-Information, 2021 This paper introduces a prospective study of the potential of spatio-temporal graphs (ST-graphs) and knowledge graphs (K-graphs) for the modelling of geographical phenomena.
Géraldine Del Mondo +4 more
doaj +1 more source
Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs
Discrete Mathematics, 1984 Let G be a simple finite and connected graph with the vertex set V(G) and the edge set X(G). Let V'(G) be the family of all one-point subsets of V(G). Both the line graph L(G) of G and the total graph T(G) of G are standard graph theoretical concepts. The middle graph M(G) of G is the intersection graph of \(V'(G)\cup X(G)\) and the quasi-total graph P(
Sastry, D.V.S, Raju, B.Syam Prasad
openaire +2 more sources
Graph saturation in multipartite graphs [PDF]
Journal of Combinatorics, 2016 16 pages, 4 ...
Ferrara, Michael +3 more
openaire +2 more sources
New results for the degree/diameter problem [PDF]
, 1994 The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups.
Dinneen, Michael J., Hafner, Paul R.
core +1 more source
Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis
Entropy, 2021 Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object.
Amirmohammad Farzaneh +2 more
doaj +1 more source
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
B. Basavanagoud, Veena Mathad
openaire +2 more sources
Planar Graphs as VPG-Graphs [PDF]
Journal of Graph Algorithms and Applications, 2013 Summary: A graph is \(B_k\)-VPG when it has an intersection representation by paths in a rectangular grid with at most \(k\) bends (turns). It is known that all planar graphs are \(B_3\)-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are \(B_2\)-VPG.
Chaplick, Steven, Ueckerdt, Torsten
openaire +3 more sources