On a distance-constrained graph labeling to model cooperation
DOI10.1016/J.DAM.2021.09.018zbMATH Open1477.05160OpenAlexW3201719629MaRDI QIDQ2243133FDOQ2243133
Authors: John P. Georges, Kirsti Kuenzel, David Mauro, Per Sebastian Skardal
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
Recommendations
Programming involving graphs or networks (90C35) Distance in graphs (05C12) Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Complex networks: structure and dynamics
- Chemical oscillations, waves, and turbulence
- Relating path coverings to vertex labellings with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- Random graph models of social networks
- Dynamical systems on networks. A tutorial
- A survey on labeling graphs with a condition at distance two
- Approximations for -Colorings of Graphs
- \(L(3,2,1)\)-labeling of graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Labeling trees with a condition at distance two
- Graph labellings with variable weights, a survey
- Real Number Graph Labellings with Distance Conditions
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
This page was built for publication: On a distance-constrained graph labeling to model cooperation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243133)