Algorithms and complexity results for finding graphs with extremal Randić index

DOI10.1002/net.21680zbMath1386.05035OpenAlexW2338515455MaRDI QIDQ4642420

David J. Phillips, Rex K. Kincaid, Sarah J. Kunkler, M. Drew LaMar

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21680

zbMATH Keywords

synchronizationdegree sequencegeneralized Randić indexcortical networksconnectivity constraintnetwork realizationminimum weight perfect \(b\)-matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Vertex degrees (05C07)

Related Items

Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree ⋮ Constraints for symmetry breaking in graph representation