Structural Analysis of Complex Networks

DOI10.1007/978-0-8176-4789-6MaRDI QIDQ3628782zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 26 May 2009

Full work available at URL https://doi.org/10.1007/978-0-8176-4789-6

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15)

Cited in

(35)

• On coindices of graphs and their complements
• Center and its spectrum of almost all n-vertex graphs of given diameter
• Network differential connectivity analysis
• A Brief Introduction to Complex Networks and Their Analysis
• Partitions of Graphs
• Distance in graphs
• Domination in Graphs
• Spectrum and entropy for infinite directed graphs
• Application of infinite labeled graphs to symbolic dynamical systems
• Decompositions and factorizations of complete graphs
• Geodetic sets in graphs
• Graph polynomials and their applications. I: The Tutte polynomial
• Graph polynomials and their applications. II: Interrelations and interpretations
• Reconstruction problems for graphs, Krawtchouk polynomials, and Diophantine equations
• Subgraphs as a measure of similarity
• A Chromatic Metric on Graphs
• Some applications of eigenvalues of graphs
• Minimum spanning Markovian trees: Introducing context-sensitivity into the generation of spanning trees
• Link-based network mining
• Graph Representations and Algorithms in Computational Biology of RNA Secondary Structure
• Inference of protein function from the structure of interaction networks
• Applications of perfect matchings in chemistry
• scientific article; zbMATH DE number 5866276 (Why is no real title available?)
• Analysis of Complex Networks
• The adjacency matroid of a graph
• Computational Intelligence for Network Structure Analytics
• On minimum cutsets in independent domination vertex critical graphs
• Bounds for zeros of Meixner and Kravchuk polynomials
• A characterization of 3-i-critical graphs of connectivity two
• Multiscale analysis and data networks
• On the Wiener index of orientations of graphs
• Quantitative graph theory: a new branch of graph theory and network science
• Some toughness results in independent domination critical graphs
• Domination criticality in product graphs
• A computational approach to construct a multivariate complete graph invariant

This page was built for publication: Structural Analysis of Complex Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628782)