scholarly journals Study of Identifying Code Polyhedra for Some Families of Split Graphs

2014 ◽  
pp. 13-25 ◽  
Author(s):  
Gabriela Argiroffo ◽  
Silvia Bianchi ◽  
Annegret Wagler
Keyword(s):  
Identifying Code ◽  
Split Graphs

scholarly journals Progress on the description of identifying code polyhedra for some families of split graphs

2016 ◽  
Vol 22 ◽  
pp. 225-240 ◽  
Author(s):  
Gabriela Argiroffo ◽  
Silvia Bianchi ◽  
Annegret Wagler
Keyword(s):  
Identifying Code ◽  
Split Graphs

Graphic sequences and split graphs

2016 ◽  
Vol 32 (4) ◽  
pp. 1005-1014
Author(s):  
Jian-hua Yin ◽  
Lei Meng ◽  
Meng-Xiao Yin
Keyword(s):  
Split Graphs

Split graphs

2021 ◽  
pp. 189-206
Author(s):  
Karen L. Collins ◽  
Ann N. Trenk
Keyword(s):  
Split Graphs

scholarly journals The Evolution of Networks and Local Public Good Provision: A Potential Approach

Games ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 55
Author(s):  
Markus Kinateder ◽  
Luca Paolo Merlino
Keyword(s):  
Public Good ◽  
Nash Equilibria ◽  
Potential Game ◽  
Public Good Provision ◽  
Local Public Good ◽  
Steady State Distribution ◽  
State Distribution ◽  
Long Run ◽  
Split Graphs ◽  
Good Provision

In this paper, we propose a game in which each player decides with whom to establish a costly connection and how much local public good is provided when benefits are shared among neighbors. We show that, when agents are homogeneous, Nash equilibrium networks are nested split graphs. Additionally, we show that the game is a potential game, even when we introduce heterogeneity along several dimensions. Using this result, we introduce stochastic best reply dynamics and show that this admits a unique and stationary steady state distribution expressed in terms of the potential function of the game. Hence, even if the set of Nash equilibria is potentially very large, the long run predictions are sharp.

scholarly journals The minimum density of an identifying code in the king lattice

2004 ◽  
Vol 276 (1-3) ◽  
pp. 95-109 ◽  
Author(s):  
Irène Charon ◽  
Iiro Honkala ◽  
Olivier Hudry ◽  
Antoine Lobstein
Keyword(s):  
Identifying Code ◽  
Minimum Density

scholarly journals On graphs having a V⧹{x} set as an identifying code

2007 ◽  
Vol 307 (3-5) ◽  
pp. 432-434 ◽  
Author(s):  
Sylvain Gravier ◽  
Julien Moncel
Keyword(s):  
Identifying Code

On class 2 split graphs

2010 ◽  
Vol 39 (17) ◽  
Author(s):  
Sheila de Almeida ◽  
Celia de Mello ◽  
Aurora Morgana
Keyword(s):  
Split Graphs

Three-rainbow coloring of split graphs

2015 ◽  
Vol 21 (3) ◽  
pp. 284-287
Author(s):  
Yumei Hu ◽  
Tingting Liu
Keyword(s):  
Split Graphs ◽  
Rainbow Coloring
Sign in / Sign up

Export Citation Format

Share Document