journal article
oaidoi:10.1016/0166-218X(94)00073-9

Well irredundant graphs

Authors
Publication date
8 December 1995
Publisher
Published by Elsevier B.V.
Doi

    Abstract

    AbstractA vertex x in a subset X of vertices of a graph is redundant if its closed neighbourhood is contained in the union of closed neighbourhoods of vertices of X − x. This paper describes the structure of bipartite graphs, chordal graphs and graphs of girth at least five in which every maximal set of vertices having no redundancies is maximum

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/0166-218X(94)00073...
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.