nanoll extt
Please use this identifier to cite or link to this item: http://lrcdrs.bennett.edu.in:80/handle/123456789/5032
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSahoo, Gopinath-
dc.date.accessioned2024-06-13T08:26:07Z-
dc.date.available2024-06-13T08:26:07Z-
dc.date.issued2023-
dc.identifier.issn9728600-
dc.identifier.urihttps://doi.org/10.1080/09728600.2023.2234014-
dc.identifier.urihttp://lrcdrs.bennett.edu.in:80/handle/123456789/5032-
dc.description.abstractIn this article, we associate a Hermitian matrix to a multidigraph G. We call it the complex Laplacian matrix of G and denote it by LC(G). It is shown that the complex Laplacian matrix is a generalization of the Laplacian matrix of a graph. But, unlike the Laplacian matrix of a graph, the complex Laplacian matrix of a multidigraph may not always be singular. We obtain a necessary and sufficient condition for the complex Laplacian matrix of a multidigraph to be singular. For a multidigraph G, if LC(G) is singular, we say G is LC-singular. We generalize some properties of the Fiedler vectors of undirected graphs to the eigenvectors corresponding to the second smallest eigenvalue of LC-singular multidigraphs.en_US
dc.language.isoen_USen_US
dc.publisherAKCE International Journal of Graphs and Combinatoricsen_US
dc.titleOn singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphsen_US
dc.typeArticleen_US
dc.indexedscen_US
Appears in Collections:Conference/Seminar Papers_ SCSET

Files in This Item:
File Description SizeFormat 
On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs.pdf
  Restricted Access
1.53 MBAdobe PDFView/Open Request a copy

Contact admin for Full-Text

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.