关于广义积图的广义组合性质

Nopparat Pleanmani, S. Panma
{"title":"关于广义积图的广义组合性质","authors":"Nopparat Pleanmani, S. Panma","doi":"10.19184/ijc.2022.6.2.5","DOIUrl":null,"url":null,"abstract":"<p>A property ℘ is defined to be a nonempty isomorphism-closed subclass of the class of all finite simple graphs. A nonempty set <em>S</em> of vertices of a graph <em>G</em> is said to be a ℘-set of <em>G</em> if <em>G</em>[<em>S</em>]∈ ℘. The maximum and minimum cardinalities of a ℘-set of <em>G</em> are denoted by <em>M</em><sub>℘</sub>(<em>G</em>) and <em>m</em><sub>℘</sub>(<em>G</em>), respectively. If <em>S</em> is a ℘-set such that its cardinality equals <em>M</em><sub>℘</sub>(<em>G</em>) or <em>m</em><sub>℘</sub>(<em>G</em>), we say that <em>S</em> is an <em>M</em><sub>℘</sub>-set or an <em>m</em><sub>℘</sub>-set of <em>G</em>, respectively. In this paper, we not only define six types of property ℘ by the using concepts of graph product and generalized graph product, but we also obtain <em>M</em><sub>℘</sub> and <em>m</em><sub>℘</sub> of product graphs in each type and characterize its <em>M</em><sub>℘</sub>-set.</p>","PeriodicalId":13506,"journal":{"name":"Indonesian Journal of Combinatorics","volume":"28 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On generalized composed properties of generalized product graphs\",\"authors\":\"Nopparat Pleanmani, S. Panma\",\"doi\":\"10.19184/ijc.2022.6.2.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A property ℘ is defined to be a nonempty isomorphism-closed subclass of the class of all finite simple graphs. A nonempty set <em>S</em> of vertices of a graph <em>G</em> is said to be a ℘-set of <em>G</em> if <em>G</em>[<em>S</em>]∈ ℘. The maximum and minimum cardinalities of a ℘-set of <em>G</em> are denoted by <em>M</em><sub>℘</sub>(<em>G</em>) and <em>m</em><sub>℘</sub>(<em>G</em>), respectively. If <em>S</em> is a ℘-set such that its cardinality equals <em>M</em><sub>℘</sub>(<em>G</em>) or <em>m</em><sub>℘</sub>(<em>G</em>), we say that <em>S</em> is an <em>M</em><sub>℘</sub>-set or an <em>m</em><sub>℘</sub>-set of <em>G</em>, respectively. In this paper, we not only define six types of property ℘ by the using concepts of graph product and generalized graph product, but we also obtain <em>M</em><sub>℘</sub> and <em>m</em><sub>℘</sub> of product graphs in each type and characterize its <em>M</em><sub>℘</sub>-set.</p>\",\"PeriodicalId\":13506,\"journal\":{\"name\":\"Indonesian Journal of Combinatorics\",\"volume\":\"28 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-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.2022.6.2.5\",\"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.2022.6.2.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

性质p被定义为所有有限简单图类的非空同构闭子类。如果G[S]∈p,则图G的顶点的非空集S称为G的p集。p的最大和最小基数分别用M p (G)和M p (G)表示。如果S是一个p -set使得它的基数等于M p (G)或M p (G),我们说S是一个M p -set或G的M p -set。本文利用图积和广义图积的概念定义了六种性质的p (p),得到了每种类型的p (p)图的p (p)和p (p),并对其p (p)集进行了刻画。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On generalized composed properties of generalized product graphs

A property ℘ is defined to be a nonempty isomorphism-closed subclass of the class of all finite simple graphs. A nonempty set S of vertices of a graph G is said to be a ℘-set of G if G[S]∈ ℘. The maximum and minimum cardinalities of a ℘-set of G are denoted by M(G) and m(G), respectively. If S is a ℘-set such that its cardinality equals M(G) or m(G), we say that S is an M-set or an m-set of G, respectively. In this paper, we not only define six types of property ℘ by the using concepts of graph product and generalized graph product, but we also obtain M and m of product graphs in each type and characterize its M-set.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
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
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1