Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorRamane, Harishchandra S.en_US
dc.contributor.authorPatil, Daneshwarien_US
dc.contributor.authorParvathalu, Bolleen_US
dc.contributor.authorAshoka, K.en_US
dc.date.accessioned2023-10-10T17:22:36Z
dc.date.available2023-10-10T17:22:36Z
dc.date.issued2023-10
dc.identifier.citationRamane, H. S., Patil, D., Parvathalu, B. & Ashoka, K. (2023). Signless Laplacian polynomial for splice and link of graphs. TWMS Journal Of Applied And Engineering Mathematics, 13(4), 1526-1536.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5733
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/current/122-vol13no4/1134
dc.description.abstractThe signless Laplacian matrix of a graph G is Q(G) = A(G) + D(G), where A(G) is the adjacency matrix and D(G) is the diagonal degree matrix of a graph G. The characteristic polynomial of the signless Laplacian matrix is called the signless Laplacian polynomial. The present work is all about the study of signless Laplacian polynomial for the splice of more than two graphs and the link of such graphs. It is noted that such a study is easier when we take into account of the vertex set partition being an equitable partition, because equitable partition of the vertex set reduces the computational steps and also the quotient matrix polynomial is a part of the polynomial of a graph. In this paper we consider the splice and links of complete graphs and of complete bipartite graphs and obtain the signless Laplacian polynomial of these using equitable partition of the vertex set.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectSignless Laplacian polynomialen_US
dc.subjectEquitable partitionen_US
dc.subjectSpliceen_US
dc.subjectLinken_US
dc.titleSignless Laplacian polynomial for splice and link of graphsen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume13
dc.identifier.issue4
dc.identifier.startpage1526
dc.identifier.endpage1536
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakEmerging Sources Citation Index (ESCI)en_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess