The competition number of a generalized line graph is at most two - Archive ouverte HAL
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2012

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

Résumé

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.
Fichier principal
Vignette du fichier
2041-7329-1-PB.pdf (106.69 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00990584 , version 1 (13-05-2014)

Identifiants

Citer

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

Collections

TDS-MACS
51 Consultations
1158 Téléchargements

Altmetric

Partager

More