Abstract: Extremely large graphs, such as those representing the Web or online social networks, require prohibitively large computational resources for an analysis of any of their complex properties.

With many examples, we will investigate dependencies between some properties of graphs and their spatial embeddings. In particular, we will see relations between the minimal abstract genus of a graph ...

Download PDF Join the Discussion View in the ACM Digital Library EXAMPLE 2. A standard way of representing graphs is by their adjacency matrices; once we have an adjacency matrix we can obtain a {0, 1 ...

Abstract: We study the Fourier dimensions of graphs of real-valued functions defined on the unit interval [0,1]. Our results imply that the graph of fractional Brownian motion is almost surely not a ...

This paper presents the practical applications of Laplacian and signless Laplacian spectra across various fields including theoretical chemistry, computer science, electrical engineering, and complex ...

ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...

ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...

Mathematica Scandinavica has been published regularly since 1953. Mathematica Scandinavica is a non-profit company, which is operated by the five mathematical societies in Scandinavia. It is the aim ...