论某些不相连的图联盟的 2 标记图

IF 0.5 Q3 MATHEMATICS

Malaysian Journal of Mathematical Sciences Pub Date : 2023-12-14 DOI:10.47836/mjms.17.4.12

Y. Susanti,

{"title":"论某些不相连的图联盟的 2 标记图","authors":"Y. Susanti,","doi":"10.47836/mjms.17.4.12","DOIUrl":null,"url":null,"abstract":"The k-token graph of a given graph G, is the graph which vertex set consists of all k−\nsubsets of the vertex set of G and two vertices are connected by an edge exactly when their difference corresponds to an edge of G. In this paper, we give a description on the structure of the 2-token graph of disjoint union of multiple graphs. This result complements the previous findings regarding the properties of the k-token graphs.","PeriodicalId":43645,"journal":{"name":"Malaysian Journal of Mathematical Sciences","volume":"166 3","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the 2-Token Graphs of Some Disjoint Union of Graphs\",\"authors\":\"Y. Susanti,\",\"doi\":\"10.47836/mjms.17.4.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The k-token graph of a given graph G, is the graph which vertex set consists of all k−\\nsubsets of the vertex set of G and two vertices are connected by an edge exactly when their difference corresponds to an edge of G. In this paper, we give a description on the structure of the 2-token graph of disjoint union of multiple graphs. This result complements the previous findings regarding the properties of the k-token graphs.\",\"PeriodicalId\":43645,\"journal\":{\"name\":\"Malaysian Journal of Mathematical Sciences\",\"volume\":\"166 3\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Malaysian Journal of Mathematical Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47836/mjms.17.4.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Malaysian Journal of Mathematical Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47836/mjms.17.4.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

给定图 G 的 k 标记图是指顶点集由 G 的顶点集的所有 k 个子集组成的图，当两个顶点的差值对应于 G 的一条边时，这两个顶点正好通过一条边相连。这一结果补充了之前关于 k 标记图性质的发现。

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

查看原文本刊更多论文

On the 2-Token Graphs of Some Disjoint Union of Graphs

The k-token graph of a given graph G, is the graph which vertex set consists of all k− subsets of the vertex set of G and two vertices are connected by an edge exactly when their difference corresponds to an edge of G. In this paper, we give a description on the structure of the 2-token graph of disjoint union of multiple graphs. This result complements the previous findings regarding the properties of the k-token graphs.

求助全文

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

来源期刊

Malaysian Journal of Mathematical Sciences MATHEMATICS-

CiteScore

1.10

自引率

20.00%

发文量

期刊介绍： The Research Bulletin of Institute for Mathematical Research (MathDigest) publishes light expository articles on mathematical sciences and research abstracts. It is published twice yearly by the Institute for Mathematical Research, Universiti Putra Malaysia. MathDigest is targeted at mathematically informed general readers on research of interest to the Institute. Articles are sought by invitation to the members, visitors and friends of the Institute. MathDigest also includes abstracts of thesis by postgraduate students of the Institute.