非二部图边胶合运算下的l1可嵌入性

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2025-06-11 DOI:10.1016/j.dam.2025.05.036

Guangfu Wang , Chenyang Li

{"title":"非二部图边胶合运算下的l1可嵌入性","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":"{\"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}","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

摘要

1-图是图形度量空间同构于某1-空间的子空间的图。本文研究了完全图、鸡尾酒会图和半立方图中两个非二部图沿一条边胶合得到的图的11可嵌入性。我们证明了只有两个完全图沿一条边粘接得到的图是一个11 -图，其他的图都不是，除了一些平凡的情况。这就回答了Wang and Zhang（2013）提出的问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

l1-embeddability under the edge-gluing operation on some nonbipartite graphs

l_{1}

-graph is a graph whose graphic metric space is isomorphic to a subspace of some

l_{1}

-space. In this work, we study the

l_{1}

-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

l_{1}

-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).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： 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.