Results 21 to 30 of about 926,750 (319)
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory
Entropy, 2022 The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties.
Igal Sason
doaj +1 more source
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
Plick Graphs with Crossing Number 1 [PDF]
, 2011 In this paper, we deduce a necessary and sufficient condition for graphs whose plick graphs have crossing number 1. We also obtain a necessary and sufficient condition for plick graphs to have crossing number 1 in terms of forbidden ...
Basavanagoud, B., Kulli, V.R.
core +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
On the independence graph of a graph
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bostjan Bresar, Blaz Zmazek
openaire +2 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
Minimum Cycle Base of Graphs Identified by Two Planar Graphs [PDF]
, 2007 In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-connected planar graphs by identifying an edge (or a cycle) of one graph with the corresponding edge (or cycle) of another, related with map geometries, i.e ...
Han, Ren, Dengju, Ma
core +1 more source
Open Distance-Pattern Uniform Graphs [PDF]
, 2009 All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
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
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(
D. V. S. Sastry, B. Syam Prasad Raju
openaire +2 more sources