On a distance-constrained graph labeling to model cooperation
From MaRDI portal
Publication:2243133
DOI10.1016/j.dam.2021.09.018zbMath1477.05160OpenAlexW3201719629MaRDI QIDQ2243133
P. S. Skardal, David W. Mauro, John P. Georges, Kirsti Kuenzel
Publication date: 11 November 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.09.018
Programming involving graphs or networks (90C35) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)
Cites Work
- \(L(3,2,1)\)-labeling of graphs
- Chemical oscillations, waves, and turbulence
- Dynamical systems on networks. A tutorial
- Graph labellings with variable weights, a survey
- Relating path coverings to vertex labellings with a condition at distance two
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- Complex networks: structure and dynamics
- A survey on labeling graphs with a condition at distance two
- Real Number Graph Labellings with Distance Conditions
- Labelling Graphs with a Condition at Distance 2
- Approximations for -Colorings of Graphs
- Random graph models of social networks
- The $L(2,1)$-Labeling Problem on Graphs
- Labeling trees with a condition at distance two
- Unnamed Item
- Unnamed Item
This page was built for publication: On a distance-constrained graph labeling to model cooperation