星-超幻图的新族

Indonesian Journal of Combinatorics Pub Date : 2020-12-31 DOI:10.19184/IJC.2020.4.2.4

A. Ngurah

{"title":"星-超幻图的新族","authors":"A. Ngurah","doi":"10.19184/IJC.2020.4.2.4","DOIUrl":null,"url":null,"abstract":"A simple graph G admits a K1,n-covering if every edge in E(G) belongs to a subgraph of G isomorphic to K1,n. The graph G is K1,n-supermagic if there exists a bijection f : V(G) ∪ E(G) → {1, 2, 3,..., |V(G) ∪ E(G)|} such that for every subgraph H' of G isomorphic to K1,n, ∑v ∈ V(H') f(v) + ∑e ∈ E(H') f(e) is a constant and f(V(G)) = {1, 2, 3,..., |V(G)|}. In such a case, f is called a K1,n-supermagic labeling of G. In this paper, we give a method how to construct K1,n-supermagic graphs from the old ones.","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"34 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New families of star-supermagic graphs\",\"authors\":\"A. Ngurah\",\"doi\":\"10.19184/IJC.2020.4.2.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A simple graph G admits a K1,n-covering if every edge in E(G) belongs to a subgraph of G isomorphic to K1,n. The graph G is K1,n-supermagic if there exists a bijection f : V(G) ∪ E(G) → {1, 2, 3,..., |V(G) ∪ E(G)|} such that for every subgraph H' of G isomorphic to K1,n, ∑v ∈ V(H') f(v) + ∑e ∈ E(H') f(e) is a constant and f(V(G)) = {1, 2, 3,..., |V(G)|}. In such a case, f is called a K1,n-supermagic labeling of G. In this paper, we give a method how to construct K1,n-supermagic graphs from the old ones.\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"34 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Indonesian Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.19184/IJC.2020.4.2.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.19184/IJC.2020.4.2.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如果E(G)中的每条边都属于G同构于K1,n的子图，则简单图G允许K1,n覆盖。图G是K1,n-超幻，如果存在一个双射f: V(G)∪E(G)→{1,2,3，…| V (G)∪E (G) |}例如对于每个子图H的G的同构K1, n,∑V∈(H) f (V) +∑E∈f E (H) (E)是一个常数和f (V (G)) ={1, 2, 3,…| V (G) |}。在这种情况下，f称为g的K1,n-超幻标记。本文给出了一种由旧图构造K1,n-超幻图的方法。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

New families of star-supermagic graphs

A simple graph G admits a K_1,n-covering if every edge in E(G) belongs to a subgraph of G isomorphic to K_1,n. The graph G is K_1,n-supermagic if there exists a bijection f : V(G) ∪ E(G) → {1, 2, 3,..., |V(G) ∪ E(G)|} such that for every subgraph H' of G isomorphic to K_1,n, ∑v_{∈ V(H')} f(v) + ∑_{e ∈ E(H')} f(e) is a constant and f(V(G)) = {1, 2, 3,..., |V(G)|}. In such a case, f is called a K_1,n-supermagic labeling of G. In this paper, we give a method how to construct K_1,n-supermagic graphs from the old ones.

求助全文

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

来源期刊

Indonesian Journal of Combinatorics

自引率

0.00%

发文量

期刊最新文献

A note on vertex irregular total labeling of trees On Ramsey (mK2,bPn)-minimal Graphs Local Strong Rainbow Connection Number of Corona Product Between Cycle Graphs Γ-supermagic labeling of products of two cycles with cyclic groups On graphs associated to topological spaces