Graphs determined by signless Laplacian spectra
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 determinin...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2018-06 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Abdian, Ali Zeydi Behmaram, Afshin Gholam Hossein Fath-Tabar |
description | 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 |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2073561582</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2073561582</sourcerecordid><originalsourceid>FETCH-proquest_journals_20735615823</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQdy9KLMgoVkhJLUktys3MS01RSKpUKM5Mz8tJLS5W8EksyElMzkzMUyguSE0uKUrkYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IwNzY1MzQ1MLI2PiVAEAQ1Ey4g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2073561582</pqid></control><display><type>article</type><title>Graphs determined by signless Laplacian spectra</title><source>Free E- Journals</source><creator>Abdian, Ali Zeydi ; Behmaram, Afshin ; Gholam Hossein Fath-Tabar</creator><creatorcontrib>Abdian, Ali Zeydi ; Behmaram, Afshin ; Gholam Hossein Fath-Tabar</creatorcontrib><description>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>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Apexes ; Combinatorial analysis ; Graph theory ; Graphs ; Machine learning ; Number theory ; Optimization ; Spectra</subject><ispartof>arXiv.org, 2018-06</ispartof><rights>2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>780,784</link.rule.ids></links><search><creatorcontrib>Abdian, Ali Zeydi</creatorcontrib><creatorcontrib>Behmaram, Afshin</creatorcontrib><creatorcontrib>Gholam Hossein Fath-Tabar</creatorcontrib><title>Graphs determined by signless Laplacian spectra</title><title>arXiv.org</title><description>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>Algorithms</subject><subject>Apexes</subject><subject>Combinatorial analysis</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Machine learning</subject><subject>Number theory</subject><subject>Optimization</subject><subject>Spectra</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mTQdy9KLMgoVkhJLUktys3MS01RSKpUKM5Mz8tJLS5W8EksyElMzkzMUyguSE0uKUrkYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4IwNzY1MzQ1MLI2PiVAEAQ1Ey4g</recordid><startdate>20180626</startdate><enddate>20180626</enddate><creator>Abdian, Ali Zeydi</creator><creator>Behmaram, Afshin</creator><creator>Gholam Hossein Fath-Tabar</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20180626</creationdate><title>Graphs determined by signless Laplacian spectra</title><author>Abdian, Ali Zeydi ; Behmaram, Afshin ; Gholam Hossein Fath-Tabar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20735615823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Combinatorial analysis</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Machine learning</topic><topic>Number theory</topic><topic>Optimization</topic><topic>Spectra</topic><toplevel>online_resources</toplevel><creatorcontrib>Abdian, Ali Zeydi</creatorcontrib><creatorcontrib>Behmaram, Afshin</creatorcontrib><creatorcontrib>Gholam Hossein Fath-Tabar</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Abdian, Ali Zeydi</au><au>Behmaram, Afshin</au><au>Gholam Hossein Fath-Tabar</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Graphs determined by signless Laplacian spectra</atitle><jtitle>arXiv.org</jtitle><date>2018-06-26</date><risdate>2018</risdate><eissn>2331-8422</eissn><abstract>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><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2018-06 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2073561582 |
source | Free E- Journals |
subjects | Algorithms Apexes Combinatorial analysis Graph theory Graphs Machine learning Number theory Optimization Spectra |
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-24T01%3A18%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Graphs%20determined%20by%20signless%20Laplacian%20spectra&rft.jtitle=arXiv.org&rft.au=Abdian,%20Ali%20Zeydi&rft.date=2018-06-26&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2073561582%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2073561582&rft_id=info:pmid/&rfr_iscdi=true |