Arbitrarily regularizable graphs

DOI10.24166/im.10.2017zbMath1491.05183arXiv1608.06427OpenAlexW2963919960MaRDI QIDQ3389691

Enrico Bozzo, Massimo Franceschet

Publication date: 23 March 2022

Published in: Internet Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

signed networksgraph regularizabilitymatrix chainabilitypower in networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• The chainable matrix, a special combinatorial matrix
• Regularisable graphs, II
• On the existence of sequences and matrices with prescribed partial sums of elements
• Patterns that allow given row and column sums
• Patterns, linesums, and symmetry
• Concerning nonnegative matrices and doubly stochastic matrices
• A fast algorithm for matrix balancing
• Fair Majority Voting (or How to Eliminate Gerrymandering)
• The Sinkhorn–Knopp Algorithm: Convergence and Applications
• Matrix Analysis
• Convex Sets of Non-Negative Matrices
• The Distribution of Positive Elements in Doubly-Stochastic Matrices
• Problems Involving Diagonal Products in Nonnegative Matrices
• Graphs and matrices

This page was built for publication: Arbitrarily regularizable graphs