Threshold protocol game on graphs with magic square-generalization labelings
From MaRDI portal
Cites work
- A game-theoretic approach for modeling competitive diffusion over social networks
- Cascading behavior in networks: algorithmic and economic issues
- Competitive contagion in networks
- Consecutive magic graphs
- Consensus Over Random Graph Processes: Network Borel–Cantelli Lemmas for Almost Sure Convergence
- Contagion
- Edge-sum distinguishing labeling
- Equilibria of graphical games with symmetries
- Graceful game on some graph classes
- Graph theoretic methods in multiagent networks
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 2076937 (Why is no real title available?)
- scientific article; zbMATH DE number 1760750 (Why is no real title available?)
- scientific article; zbMATH DE number 2104716 (Why is no real title available?)
- Introduction to computational social choice
- Learning, Local Interaction, and Coordination
- Magic and antimagic graphs. Attributes, observations and challenges in graph labelings
- Magic graphs, a characterization
- Magic Valuations of Finite Graphs
- Networks, crowds and markets. Reasoning about a highly connected world.
- On \(\Sigma\) and \(\Sigma'\) labelled graphs
- On representatives of subsets.
- Results on the graceful game and range-relaxed graceful game
- Rethinking centrality: the role of dynamical processes in social network analysis
- Stochastic Learning Dynamics and Speed of Convergence in Population Games
- The game \(L(d,1)\)-labeling problem of graphs
- The general position achievement game played on graphs
- Vertex magic total labellings of complete graphs
This page was built for publication: Threshold protocol game on graphs with magic square-generalization labelings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6954042)
