Results 21 to 30 of about 609,490 (168)
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
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
MATEC Web of Conferences, 2017 In architectural and construction system “Monofant” a self-supporting skeleton consisting of a spatial curvilinear framework and unrecoverable hollow-core inserts made of expanded polystyrene was used to erect buildings and structures of curved shapes ...
Bugayevskiy Sergey +3 more
doaj +1 more source
Graph Powers and Graph Homomorphisms [PDF]
The Electronic Journal of Combinatorics, 2010 In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Hajiabolhassan, Hossein, Taherkhani, Ali
openaire +3 more sources
Graphs Cospectral with Kneser Graphs [PDF]
SSRN Electronic Journal, 2009 AMS Subject Classification ...
Haemers, W.H., Ramezani, F.
openaire +5 more sources