DIKUL - logo
(UL)
  • Maximal core size in singular graphs
    Sciriha, Irene
    A graph ▫$G$▫ is singular of nullity ▫$\eta$▫ if the nullspace of its adjacency matrix ▫${\boldsymbol G}$▫ has dimension ▫$\eta$▫. Such a graph contains ▫$\eta$▫ cores determined by a basis for the ... nullspace of ▫${\boldsymbol G}$▫. These are induced subgraphs of singular configurations, the latter occurring as induced subgraphs of ▫$G$▫. We show that there exists a set of ▫$\eta$▫ distinct vertices representing the singular configurations. We also explore how the nullity controls the size of the singular substructures and characterize those graphs of maximal nullity containing a substructure reaching maximal size.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 2, no. 2, 2009, str. 217-229)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 15498841

    Povezava(-e):

    http://amc.imfm.si/index.php/amc/article/viewFile/115/79
    Digitalna knjižnica Slovenije - dLib.si

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 2, no. 2, 2009, str. 217-229)

loading ...
loading ...
loading ...

Vnos na polico