{"title":"l1-embeddability under the edge-gluing operation on some nonbipartite graphs","authors":"Guangfu Wang , Chenyang Li","doi":"10.1016/j.dam.2025.05.036","DOIUrl":null,"url":null,"abstract":"<div><div>An <span><math><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-graph is a graph whose graphic metric space is isomorphic to a subspace of some <span><math><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-space. In this work, we study the <span><math><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-embeddability of graphs obtained by gluing two nonbipartite graphs along an edge, which are from the complete graphs, cocktail party graphs and half-cubes. We show that only the graph obtained by gluing two complete graphs along an edge is also an <span><math><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-graph, and all the other graphs are not, except the trivial cases. This gives an answer to the problem proposed by Wang and Zhang (2013).</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"375 ","pages":"Pages 79-84"},"PeriodicalIF":1.0000,"publicationDate":"2025-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25002914","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
An -graph is a graph whose graphic metric space is isomorphic to a subspace of some -space. In this work, we study the -embeddability of graphs obtained by gluing two nonbipartite graphs along an edge, which are from the complete graphs, cocktail party graphs and half-cubes. We show that only the graph obtained by gluing two complete graphs along an edge is also an -graph, and all the other graphs are not, except the trivial cases. This gives an answer to the problem proposed by Wang and Zhang (2013).
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.