[图书][B] Quantitative graph theory

M Dehmer, V Kraus, F Emmert-Streib, S Pickl - 2014 - api.taylorfrancis.com
Graph theory [12, 83, 86] is a relatively new branch of mathematics and the main body of
fundamental results dates back to the seminal contribution due to König [111]. Earlier …

On graph entropy measures based on the number of independent sets and matchings

P Wan, X Chen, J Tu, M Dehmer, S Zhang… - Information …, 2020 - Elsevier
In this paper, we consider the graph entropy measures based on the number of independent
sets and matchings. The reason to study these measures relates to the fact that the …

Graph entropy based on the number of spanning forests of c-cyclic graphs

P Wan, J Tu, M Dehmer, S Zhang… - Applied Mathematics and …, 2019 - Elsevier
Graph entropies have been introduced to quantitatively measure the structural information
content of graphs and networks; they have plenty of applications in various fields. Utilizing …

Methods for Analyzing Early Stage Naval Distributed Systems Designs, Employing Simplex, Multislice, and Multiplex Networks.

DT Rigterink - 2014 - deepblue.lib.umich.edu
Naval ships are some of the most complex systems ever engineered. The process by which
they are designed is similarly complex. The complexity and disjointedness of this process …

Graph entropy: Recent results and perspectives

X Li, M Wei - … Foundations and Applications of Graph Entropy, 2016 - Wiley Online Library
The entropy of a graph was first introduced by Rashevsky [1] and Trucco [2] to interpret as
the structural information content of the graph and serve as a complexity measure. In this …

A network complexity metric based on planarity and community structure

D Rigterink, DJ Singer - Journal of Complex Networks, 2014 - academic.oup.com
This article proposes a network complexity metric based on the concepts of planarity and
network communities. This work considers planarity as an analogue for network complexity …

Dimension Measure for Complex Networks

O Shanker - Advances in Network Complexity, 2013 - Wiley Online Library
In this chapter, the authors survey one of the complexity measures, the measure based on
graph dimension. The first section of this chapter reviews the volume definition of dimension …

Using Link Disconnection Entropy Disorder to Detect Fast Moving Nodes in MANETs

CF Alvarez, LE Palafox, L Aguilar, MA Sanchez… - Plos one, 2016 - journals.plos.org
Mobile ad-hoc networks (MANETs) are dynamic by nature; this dynamism comes from node
mobility, traffic congestion, and other transmission conditions. Metrics to evaluate the effects …

A survey of recent results in (generalized) graph entropies

X Li, M Wei - arXiv preprint arXiv:1505.04658, 2015 - arxiv.org
The entropy of a graph was first introduced by Rashevsky\cite {Rashevsky} and Trucco\cite
{Trucco} to interpret as the structural information content of the graph and serve as a …

Modelo de selección de ruta utilizando desorden de entropía en desconexión de enlace en redes manet

CF Alvarez Salgado - repositorioinstitucional.uabc.mx
Universidad Autónoma de Baja California ”MODELO DE SELECCION DE RUTA UTILIZANDO
DESORDEN DE ENTROPIA EN DESCONEXION DE ENLACE Page 1 Universidad Autónoma …