Graphs determined by signless Laplacian spectra

Graphs determined by signless Laplacian spectra

AKCE International Journal of Graphs and Combinatorics, 2018 In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An imp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Abdian, Ali Zeydi, Behmaram, Afshin, Fath-Tabar, Gholam Hossein
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Abdian, Ali Zeydi
Behmaram, Afshin
Fath-Tabar, Gholam Hossein
description AKCE International Journal of Graphs and Combinatorics, 2018 In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An important part of spectral graph theory is devoted to determining whether given graphs or classes of graphs are determined by their spectra or not. So, finding and introducing any class of graphs which are determined by their spectra can be an interesting and important problem. A graph is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a DQS graph G, we show that G[rK1 [sK2 is DQS under certain conditions, where r, s are natural numbers and K1 and K2 denote the complete graphs on one vertex and two vertices, respectively. Applying these results, some DQS graphs with independent edges and isolated vertices are obtained
doi_str_mv 10.48550/arxiv.1806.10004
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1806_10004</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1806_10004</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-fcba13b35986546bd1ac436d449397042ce74f0aca6e1d253ed26b7907ee6b6f3</originalsourceid><addsrcrecordid>eNotzrFqwzAQgGEtHUraB-gUvYAdyTqd7DGENi0YumQ3J-mcCBxjpBCSty9NO_3bzyfEm1Y1tNaqDeVbuta6VVhrpRQ8i80-03IqMvKF8znNHKW_y5KO88SlyJ6WiUKiWZaFwyXTi3gaaSr8-t-VOHy8H3afVf-9_9pt-4rQQTUGT9p4Y7sWLaCPmgIYjACd6ZyCJrCDUVEgZB0bazg26F2nHDN6HM1KrP-2D_Gw5HSmfB9-5cNDbn4A-Dw9sg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Graphs determined by signless Laplacian spectra</title><source>arXiv.org</source><creator>Abdian, Ali Zeydi ; Behmaram, Afshin ; Fath-Tabar, Gholam Hossein</creator><creatorcontrib>Abdian, Ali Zeydi ; Behmaram, Afshin ; Fath-Tabar, Gholam Hossein</creatorcontrib><description>AKCE International Journal of Graphs and Combinatorics, 2018 In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An important part of spectral graph theory is devoted to determining whether given graphs or classes of graphs are determined by their spectra or not. So, finding and introducing any class of graphs which are determined by their spectra can be an interesting and important problem. A graph is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a DQS graph G, we show that G[rK1 [sK2 is DQS under certain conditions, where r, s are natural numbers and K1 and K2 denote the complete graphs on one vertex and two vertices, respectively. Applying these results, some DQS graphs with independent edges and isolated vertices are obtained</description><identifier>DOI: 10.48550/arxiv.1806.10004</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2018-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1806.10004$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1806.10004$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Abdian, Ali Zeydi</creatorcontrib><creatorcontrib>Behmaram, Afshin</creatorcontrib><creatorcontrib>Fath-Tabar, Gholam Hossein</creatorcontrib><title>Graphs determined by signless Laplacian spectra</title><description>AKCE International Journal of Graphs and Combinatorics, 2018 In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An important part of spectral graph theory is devoted to determining whether given graphs or classes of graphs are determined by their spectra or not. So, finding and introducing any class of graphs which are determined by their spectra can be an interesting and important problem. A graph is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a DQS graph G, we show that G[rK1 [sK2 is DQS under certain conditions, where r, s are natural numbers and K1 and K2 denote the complete graphs on one vertex and two vertices, respectively. Applying these results, some DQS graphs with independent edges and isolated vertices are obtained</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrFqwzAQgGEtHUraB-gUvYAdyTqd7DGENi0YumQ3J-mcCBxjpBCSty9NO_3bzyfEm1Y1tNaqDeVbuta6VVhrpRQ8i80-03IqMvKF8znNHKW_y5KO88SlyJ6WiUKiWZaFwyXTi3gaaSr8-t-VOHy8H3afVf-9_9pt-4rQQTUGT9p4Y7sWLaCPmgIYjACd6ZyCJrCDUVEgZB0bazg26F2nHDN6HM1KrP-2D_Gw5HSmfB9-5cNDbn4A-Dw9sg</recordid><startdate>20180626</startdate><enddate>20180626</enddate><creator>Abdian, Ali Zeydi</creator><creator>Behmaram, Afshin</creator><creator>Fath-Tabar, Gholam Hossein</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20180626</creationdate><title>Graphs determined by signless Laplacian spectra</title><author>Abdian, Ali Zeydi ; Behmaram, Afshin ; Fath-Tabar, Gholam Hossein</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-fcba13b35986546bd1ac436d449397042ce74f0aca6e1d253ed26b7907ee6b6f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Abdian, Ali Zeydi</creatorcontrib><creatorcontrib>Behmaram, Afshin</creatorcontrib><creatorcontrib>Fath-Tabar, Gholam Hossein</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Abdian, Ali Zeydi</au><au>Behmaram, Afshin</au><au>Fath-Tabar, Gholam Hossein</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Graphs determined by signless Laplacian spectra</atitle><date>2018-06-26</date><risdate>2018</risdate><abstract>AKCE International Journal of Graphs and Combinatorics, 2018 In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An important part of spectral graph theory is devoted to determining whether given graphs or classes of graphs are determined by their spectra or not. So, finding and introducing any class of graphs which are determined by their spectra can be an interesting and important problem. A graph is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum. For a DQS graph G, we show that G[rK1 [sK2 is DQS under certain conditions, where r, s are natural numbers and K1 and K2 denote the complete graphs on one vertex and two vertices, respectively. Applying these results, some DQS graphs with independent edges and isolated vertices are obtained</abstract><doi>10.48550/arxiv.1806.10004</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1806.10004
ispartof
issn
language eng
recordid cdi_arxiv_primary_1806_10004
source arXiv.org
subjects Mathematics - Combinatorics
title Graphs determined by signless Laplacian spectra
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T02%3A13%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Graphs%20determined%20by%20signless%20Laplacian%20spectra&rft.au=Abdian,%20Ali%20Zeydi&rft.date=2018-06-26&rft_id=info:doi/10.48550/arxiv.1806.10004&rft_dat=%3Carxiv_GOX%3E1806_10004%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true