QR Code

On degree sets and the minimum orders in bipartite graphs

For any simple graph G, let D(G) denote the degree set {degG(v) : v ∈ V (G)}. Let S be a finite, nonempty set of positive integers. In this paper, we first determine the families of graphs G which are unicyclic, bipartite satisfying D(G) = S, and further obtain the graphs of minimum orders in such f...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Manoussakis Y., Patil H.P.
Format: Artigo
Langue:Inglês
Publié: University of Zielona Góra 2014-05-01
Collection:Discussiones Mathematicae Graph Theory
Sujets:
Accès en ligne:https://doi.org/10.7151/dmgt.1742
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!