Quadratic Embedding Constants of Graph Joins

Quadratic Embedding Constants of Graph Joins

The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete biparti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2022-10, Vol.38 (5), Article 161
Hauptverfasser: Lou, Zhenzhen, Obata, Nobuaki, Huang, Qiongxiang
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Embedding
Engineering Design
Graphs
Mathematics
Mathematics and Statistics
Original Paper
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 5
container_start_page
container_title Graphs and combinatorics
container_volume 38
creator Lou, Zhenzhen
Obata, Nobuaki
Huang, Qiongxiang
description The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete bipartite graphs, wheel graphs, friendship graphs, completely split graph, and some graphs associated to strongly regular graphs.
doi_str_mv 10.1007/s00373-022-02569-w
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2715238187</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2715238187</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-ae0a67c64c1a454527c7c7a25e1ad5eae182eba6d160ca47fb21b75bf7e63ed3</originalsourceid><addsrcrecordid>eNp9kE1Lw0AQhhdRsFb_gKeAV1dn9iPbHKXUqhRE6H2ZbDY1xSZ1N6H4790awZsMw1ye9x14GLtGuEMAcx8BpJEchEir84IfTtgEldRcF6hO2QQKRA6IxTm7iHELABoVTNjt20BVoL5x2WJX-qpq2k0279rYU9vHrKuzZaD9e_bSNW28ZGc1fUR_9XunbP24WM-f-Op1-Tx_WHEnseg5eaDcuFw5JKWVFsalIaE9UqU9eZwJX1JeYQ6OlKlLgaXRZW18Ln0lp-xmrN2H7nPwsbfbbght-miFQS3kDGcmUWKkXOhiDL62-9DsKHxZBHuUYkcpNkmxP1LsIYXkGIoJbjc-_FX_k_oGEApkZg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2715238187</pqid></control><display><type>article</type><title>Quadratic Embedding Constants of Graph Joins</title><source>Springer Nature - Complete Springer Journals</source><creator>Lou, Zhenzhen ; Obata, Nobuaki ; Huang, Qiongxiang</creator><creatorcontrib>Lou, Zhenzhen ; Obata, Nobuaki ; Huang, Qiongxiang</creatorcontrib><description>The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete bipartite graphs, wheel graphs, friendship graphs, completely split graph, and some graphs associated to strongly regular graphs.</description><identifier>ISSN: 0911-0119</identifier><identifier>EISSN: 1435-5914</identifier><identifier>DOI: 10.1007/s00373-022-02569-w</identifier><language>eng</language><publisher>Tokyo: Springer Japan</publisher><subject>Combinatorics ; Embedding ; Engineering Design ; Graphs ; Mathematics ; Mathematics and Statistics ; Original Paper</subject><ispartof>Graphs and combinatorics, 2022-10, Vol.38 (5), Article 161</ispartof><rights>The Author(s), under exclusive licence to Springer Japan KK, part of Springer Nature 2022. Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-ae0a67c64c1a454527c7c7a25e1ad5eae182eba6d160ca47fb21b75bf7e63ed3</citedby><cites>FETCH-LOGICAL-c319t-ae0a67c64c1a454527c7c7a25e1ad5eae182eba6d160ca47fb21b75bf7e63ed3</cites><orcidid>0000-0001-6226-2346</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00373-022-02569-w$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00373-022-02569-w$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Lou, Zhenzhen</creatorcontrib><creatorcontrib>Obata, Nobuaki</creatorcontrib><creatorcontrib>Huang, Qiongxiang</creatorcontrib><title>Quadratic Embedding Constants of Graph Joins</title><title>Graphs and combinatorics</title><addtitle>Graphs and Combinatorics</addtitle><description>The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete bipartite graphs, wheel graphs, friendship graphs, completely split graph, and some graphs associated to strongly regular graphs.</description><subject>Combinatorics</subject><subject>Embedding</subject><subject>Engineering Design</subject><subject>Graphs</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Original Paper</subject><issn>0911-0119</issn><issn>1435-5914</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kE1Lw0AQhhdRsFb_gKeAV1dn9iPbHKXUqhRE6H2ZbDY1xSZ1N6H4790awZsMw1ye9x14GLtGuEMAcx8BpJEchEir84IfTtgEldRcF6hO2QQKRA6IxTm7iHELABoVTNjt20BVoL5x2WJX-qpq2k0279rYU9vHrKuzZaD9e_bSNW28ZGc1fUR_9XunbP24WM-f-Op1-Tx_WHEnseg5eaDcuFw5JKWVFsalIaE9UqU9eZwJX1JeYQ6OlKlLgaXRZW18Ln0lp-xmrN2H7nPwsbfbbght-miFQS3kDGcmUWKkXOhiDL62-9DsKHxZBHuUYkcpNkmxP1LsIYXkGIoJbjc-_FX_k_oGEApkZg</recordid><startdate>20221001</startdate><enddate>20221001</enddate><creator>Lou, Zhenzhen</creator><creator>Obata, Nobuaki</creator><creator>Huang, Qiongxiang</creator><general>Springer Japan</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-6226-2346</orcidid></search><sort><creationdate>20221001</creationdate><title>Quadratic Embedding Constants of Graph Joins</title><author>Lou, Zhenzhen ; Obata, Nobuaki ; Huang, Qiongxiang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-ae0a67c64c1a454527c7c7a25e1ad5eae182eba6d160ca47fb21b75bf7e63ed3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Combinatorics</topic><topic>Embedding</topic><topic>Engineering Design</topic><topic>Graphs</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Original Paper</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lou, Zhenzhen</creatorcontrib><creatorcontrib>Obata, Nobuaki</creatorcontrib><creatorcontrib>Huang, Qiongxiang</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Graphs and combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lou, Zhenzhen</au><au>Obata, Nobuaki</au><au>Huang, Qiongxiang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quadratic Embedding Constants of Graph Joins</atitle><jtitle>Graphs and combinatorics</jtitle><stitle>Graphs and Combinatorics</stitle><date>2022-10-01</date><risdate>2022</risdate><volume>38</volume><issue>5</issue><artnum>161</artnum><issn>0911-0119</issn><eissn>1435-5914</eissn><abstract>The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain lexicographic product graphs. Examples include complete bipartite graphs, wheel graphs, friendship graphs, completely split graph, and some graphs associated to strongly regular graphs.</abstract><cop>Tokyo</cop><pub>Springer Japan</pub><doi>10.1007/s00373-022-02569-w</doi><orcidid>https://orcid.org/0000-0001-6226-2346</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0911-0119
ispartof Graphs and combinatorics, 2022-10, Vol.38 (5), Article 161
issn 0911-0119
1435-5914
language eng
recordid cdi_proquest_journals_2715238187
source Springer Nature - Complete Springer Journals
subjects Combinatorics
Embedding
Engineering Design
Graphs
Mathematics
Mathematics and Statistics
Original Paper
title Quadratic Embedding Constants of Graph Joins
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T19%3A20%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quadratic%20Embedding%20Constants%20of%20Graph%20Joins&rft.jtitle=Graphs%20and%20combinatorics&rft.au=Lou,%20Zhenzhen&rft.date=2022-10-01&rft.volume=38&rft.issue=5&rft.artnum=161&rft.issn=0911-0119&rft.eissn=1435-5914&rft_id=info:doi/10.1007/s00373-022-02569-w&rft_dat=%3Cproquest_cross%3E2715238187%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2715238187&rft_id=info:pmid/&rfr_iscdi=true