Logo del repository
  1. Home
 
Opzioni

Arbitrarily regularizable graphs

FRANCESCHET, Massimo
•
BOZZO, Enrico
2017
  • journal article

Periodico
INTERNET MATHEMATICS
Abstract
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative regularizable graphs have been thoroughly investigated in the literature. In this work, we propose and study arbitrarily regularizable graphs. In particular, we investigate necessary and sufficient regularization conditions on the topology of the graph and of the corresponding adjacency matrix. Moreover, we study the computational complexity of the regularization problem and characterize it as a linear programming model.
DOI
10.24166/im.10.2017
Archivio
http://hdl.handle.net/11390/1120360
info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85044761387
Diritti
open access
Scopus© citazioni
0
Data di acquisizione
Jun 14, 2022
Vedi dettagli
Visualizzazioni
4
Data di acquisizione
Apr 19, 2024
Vedi dettagli
google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback