The competition number of a generalized line graph is at most two

Abstract : In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one. In this paper, we generalize this result to the competition numbers of generalized line graphs, that is, we show that the competition number of a generalized line graph is at most two, and give necessary conditions and sufficient conditions for the competition number of a generalized line graph being one.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2012, Vol. 14 no. 2 (2), pp.1--10
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00990584
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mardi 13 mai 2014 - 16:27:32
Dernière modification le : vendredi 21 septembre 2018 - 09:42:02
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:43:45

Fichier

2041-7329-1-PB.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00990584, version 1

Collections

Citation

Boram Park, Yoshio Sano. The competition number of a generalized line graph is at most two. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2012, Vol. 14 no. 2 (2), pp.1--10. 〈hal-00990584〉

Partager

Métriques

Consultations de la notice

68

Téléchargements de fichiers

347