On a distance-constrained graph labeling to model cooperation
Authors:
- J.P. GeorgesJGJ.P. Georges
- K. KuenzelKKK. Kuenzel
- D.W. MauroDMD.W. Mauro
- P.S. SkardalPSP.S. Skardal
- 1 January 2022
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 306, 17-31
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Spontaneous synchrony in power-grid networksNature Physics, 2013
- A sensing array of radically coupled genetic ‘biopixels’Nature, 2011
- Graph labellings with variable weights, a surveyDiscrete Applied Mathematics, 2009
- Identification of direct residue contacts in protein–protein interaction by message passingProceedings of the National Academy of Sciences, 2009
- Synchronization in complex networksPhysics Reports, 2008
- Labeling trees with a condition at distance twoDiscrete Mathematics, 2006
- A survey on labeling graphs with a condition at distance twoDiscrete Mathematics, 2006
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- Approximations for -Colorings of GraphsThe Computer Journal, 2004
- Relating path coverings to vertex labellings with a condition at distance twoDiscrete Mathematics, 1994