About some robustness and complexity properties of G-graphs networks

Jean-François Culus, Marc Demange, Ruxandra Marinescu-Ghemeci, Cerasela Tanasescu. About some robustness and complexity properties of G-graphs networks. Discrete Applied Mathematics, 182:34-45, 2015. [doi]

@article{CulusDMT15,
  title = {About some robustness and complexity properties of G-graphs networks},
  author = {Jean-François Culus and Marc Demange and Ruxandra Marinescu-Ghemeci and Cerasela Tanasescu},
  year = {2015},
  doi = {10.1016/j.dam.2014.11.003},
  url = {http://dx.doi.org/10.1016/j.dam.2014.11.003},
  researchr = {https://researchr.org/publication/CulusDMT15},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {182},
  pages = {34-45},
}