The characteristics of cycle-nodes-ratio and its application to network classification

DOI10.1016/j.cnsns.2021.105804zbMath1466.92064arXiv2103.05911OpenAlexW3192029428WikidataQ112880682 ScholiaQ112880682MaRDI QIDQ2025536

Weibing Deng, Wei Li, Wen-Jun Zhang

Publication date: 14 May 2021

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.05911

zbMATH Keywords

giant componentdepth first searchcycle nodes rationetwork classification

Mathematics Subject Classification ID

Applications of graph theory (05C90) Systems biology, networks (92C42)

Uses Software

• Pajek
• Pajek datasets
• SNAP
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Loop statistics in complex networks
• Statistical analysis of network data. Methods and models
• Graph theoretical criteria for stability and boundedness of predator-prey systems
• Eulerian graphs and related topics. Part 1, Volume 1
• Optimal segmentation of directed graph and the minimum number of feedback arcs
• Sudden emergence of a giant \(k\)-core in a random graph
• Tree-shaped networks with loops
• From the Cover: The structure of scientific collaboration networks
• Emergence of Scaling in Random Networks
• On the strength of connectedness of a random graph
• Community structure in social and biological networks
• Message passing on networks with loops
• Collective dynamics of ‘small-world’ networks
• On the Tree Graph of a Matroid
• Depth-First Search and Linear Graph Algorithms
• Spin Glass approach to the feedback vertex set problem

This page was built for publication: The characteristics of cycle-nodes-ratio and its application to network classification