Results 21 to 30 of about 86,434 (167)
Limit distributions of vertex degrees in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 The configuration graph where vertex degrees are independent identically distributed random variables is often used for modeling of complex networks such as the Internet. We consider a random graph consisting of N vertices.
Irina Chepliukova, Yuri Pavlov
doaj +1 more source
On coherent configuration of circular-arc graphs [PDF]
Communications in Combinatorics and OptimizationFor any graph, Weisfeiler and Leman assigned the smallest matrix algebra which contains the adjacency matrix of the graph. The coherent configuration underlying this algebra for a graph $\Gamma$ is called the coherent configuration of $\Gamma ...
Fatemeh Raei Barandagh +1 more
doaj +1 more source
A Self-Adapting IoT Network Configuration Supported by Distributed Graph Transformations
Applied Sciences, 2023 The research described in this article aims to propose the creation of a framework that would enable the self-optimization of IoT device networks.
Leszek Jaskierny, Leszek Kotulski
doaj +1 more source
{0,1}-Brauer Configuration Algebras and Their Applications in Graph Energy Theory
Mathematics, 2021 The energy E(G) of a graph G is the sum of the absolute values of its adjacency matrix. In contrast, the trace norm of a digraph Q, which is the sum of the singular values of the corresponding adjacency matrix, is the oriented version of the energy of a ...
Natalia Agudelo Muñetón +3 more
doaj +1 more source
ON THE MAXIMUM OF THE MODULARITY OF RANDOM CONFIGURATION GRAPHS
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019 Configuration graphs with random independent identically distributed vertex degrees are considered. The degrees are equal to the number of vertex semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj +1 more source
Bounds for the pebbling number of product graphs [PDF]
Transactions on Combinatorics, 2022 Let $G$ be a connected graph. Given a configuration of a fixed number of pebbles on the vertex set of $G$, a pebbling move on $G$ is the process of removing two pebbles from a vertex and adding one pebble on an adjacent vertex. The pebbling number of $G$,
Nopparat Pleanmani +2 more
doaj +1 more source
Construction of Directed Assortative Configuration Graphs [PDF]
Internet Mathematics, 2017 Constructions of directed configuration graphs based on a given bi-degree distribution were introduced in random graph theory some years ago. These constructions lead to graphs where the degrees of two nodes belonging to the same edge are independent.
Deprez, Philippe, Wüthrich, Mario V.
openaire +3 more sources
Unavoidable Configurations in Complete Topological Graphs [PDF]
Discrete and Computational Geometry, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pach, János +2 more
openaire +2 more sources
Process, Analyze and Visualize Telecommunication Network Configuration Data in Graph Database [PDF]
Vietnam Journal of Computer Science, 2020 In network telemetry systems, nodes produce vast number of configuration files based on how they are configured. Steps were taken to process these files into databases to help the work of the developers, testers and customer support to focus on the ...
Péter Lehotay-Kéry, Attila Kiss
doaj +1 more source
On conditional configuration graphs with random distribution of vertex degrees
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2016 We consider a configuration graph with N vertices. The degrees of the vertices are drawn independently from a discrete power-law distribution with positive parameter τ . They are equal to the number of each vertex’s numbered semiedges.
Yury Pavlov
doaj +1 more source