Twin subgraphs and core-semiperiphery-periphery structures

DOI10.1155/2018/2547270zbMath1407.90079arXiv1709.03331OpenAlexW2964143873WikidataQ129949659 ScholiaQ129949659MaRDI QIDQ1722674

Ricardo Riaza

Publication date: 18 February 2019

Published in: Complexity (Search for Journal in Brave)

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

zbMATH Keywords

structural equivalencecomplexity of very large networkscore-semiperiphery-periphery (CSP) structuretwin subgraphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)

Uses Software

• Pajek

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of optimal identifying codes in a twin-free graph
• Structural properties of twin-free graphs
• Distance-hereditary graphs
• On the number of distinct induced subgraphs of a graph
• Minimal decompositions of graphs into mutually isomorphic subgraphs
• Parallel concepts in graph theory
• Graphs with a small number of distinct induced subgraphs
• Network analysis. Methodological foundations.
• Equistable distance-hereditary graphs
• Self-Similarity of Graphs
• On homometric sets in graphs
• Disjoint homometric sets in graphs
• Extremal Graph Theory for Metric Dimension and Diameter
• Distance in stratified graphs
• The Structure of Homometric Sets
• Regular equivalence: General theory
• Core-Periphery Structure in Networks
• Networks

This page was built for publication: Twin subgraphs and core-semiperiphery-periphery structures