Construction of larger singular and nonsingular graphs using a path

John K. Rajan, T.K. Mathew Varkey, Sunoj B.
<span title="">2020</span> <i title="Malaya Journal of Matematik"> <a target="_blank" rel="noopener" href="" style="color: black;">Malaya Journal of Matematik</a> </i> &nbsp;
A singular graph G has an adjacency matrix A(G) with nullity η(G) > 0. Vertices of singular graphs are classified as core and noncore vertices. There are two types of noncore vertices: noncore vertices of zero null spread and of null spread −1. Deletion of these vertices from a singular graph either changes the nullity or leave it unaltered. In this paper larger singular and nonsingular graphs were constructed by joining singular graphs by a path. As singular graphs have different types of
more &raquo; ... ces, the graphs constructed in this way differ in nullity depending on the vertex we are joining during construction. An attempt was made to construct singular graph of maximum nullity. Various spectral properties of the resulting graphs were studied.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.26637/mjm0804/0049</a> <a target="_blank" rel="external noopener" href="">fatcat:r3v5hqcarfftpcrmcuawicfq2m</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / </button> </a>