AKCE International Journal of Graphs and Combinatorics最新文献

筛选
英文 中文
Elementary abelian covers of the Wreath graph W(3,2) and the Foster graph F26A 花环图W(3,2)和福斯特图F26A的初等阿贝尔覆盖
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-12-19 DOI: 10.1080/09728600.2022.2156310
Z. Chen, S. Kosari, S. Omidi, N. Mehdipoor, A. Talebi, H. Rashmanlou
{"title":"Elementary abelian covers of the Wreath graph W(3,2) and the Foster graph F26A","authors":"Z. Chen, S. Kosari, S. Omidi, N. Mehdipoor, A. Talebi, H. Rashmanlou","doi":"10.1080/09728600.2022.2156310","DOIUrl":"https://doi.org/10.1080/09728600.2022.2156310","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48288898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Quasi-total Roman reinforcement in graphs 图中的准全罗马强化
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-12-19 DOI: 10.1080/09728600.2022.2158051
N. Ebrahimi, J. Amjadi, M. Chellali, S. M. Sheikholeslami
{"title":"Quasi-total Roman reinforcement in graphs","authors":"N. Ebrahimi, J. Amjadi, M. Chellali, S. M. Sheikholeslami","doi":"10.1080/09728600.2022.2158051","DOIUrl":"https://doi.org/10.1080/09728600.2022.2158051","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44609501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Binding number for coprime graph of groups 群的素图的绑定数
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-12-12 DOI: 10.1080/09728600.2022.2152762
A. Mallika, J. Ahamed Thamimul Ansari
{"title":"Binding number for coprime graph of groups","authors":"A. Mallika, J. Ahamed Thamimul Ansari","doi":"10.1080/09728600.2022.2152762","DOIUrl":"https://doi.org/10.1080/09728600.2022.2152762","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42514371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The reflexive edge strength of toroidal fullerene 环形富勒烯的自反边强度
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-11-29 DOI: 10.1080/09728600.2022.2150587
M. Basher
{"title":"The reflexive edge strength of toroidal fullerene","authors":"M. Basher","doi":"10.1080/09728600.2022.2150587","DOIUrl":"https://doi.org/10.1080/09728600.2022.2150587","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41914447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Graph partitioning: an updated survey 图划分:一个更新的调查
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-11-22 DOI: 10.1080/09728600.2022.2148589
Shufei Wu, Jianfeng Hou
{"title":"Graph partitioning: an updated survey","authors":"Shufei Wu, Jianfeng Hou","doi":"10.1080/09728600.2022.2148589","DOIUrl":"https://doi.org/10.1080/09728600.2022.2148589","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45364130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On the D-differential of a graph 关于图的d微分
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-11-21 DOI: 10.1080/09728600.2022.2147039
Kijung Kim
{"title":"On the D-differential of a graph","authors":"Kijung Kim","doi":"10.1080/09728600.2022.2147039","DOIUrl":"https://doi.org/10.1080/09728600.2022.2147039","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74532852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order 奇阶的极大边θ2k+1自由非二部哈密顿图
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-11-15 DOI: 10.1080/09728600.2022.2145922
M. Jaradat, A. Baniabedalruhman, M. Bataineh, A. Jaradat, A. Al-Rhayyel
{"title":"Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order","authors":"M. Jaradat, A. Baniabedalruhman, M. Bataineh, A. Jaradat, A. Al-Rhayyel","doi":"10.1080/09728600.2022.2145922","DOIUrl":"https://doi.org/10.1080/09728600.2022.2145922","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82770826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The generalized 3-connectivity of burnt pancake graphs and godan graphs 焦饼图和高丹图的广义3连通性
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-11-10 DOI: 10.1080/09728600.2023.2212293
Jing Wang, Zuozheng Zhang, Yuanqiu Huang
{"title":"The generalized 3-connectivity of burnt pancake graphs and godan graphs","authors":"Jing Wang, Zuozheng Zhang, Yuanqiu Huang","doi":"10.1080/09728600.2023.2212293","DOIUrl":"https://doi.org/10.1080/09728600.2023.2212293","url":null,"abstract":"The generalized $k$-connectivity of a graph $G$, denoted by $kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $Ssubseteq V(G)$ and $|S|=k$. The generalized $k$-connectivity is a natural extension of the classical connectivity and plays a key role in applications related to the modern interconnection networks. The burnt pancake graph $BP_n$ and the godan graph $EA_n$ are two kinds of Cayley graphs which posses many desirable properties. In this paper, we investigate the generalized 3-connectivity of $BP_n$ and $EA_n$. We show that $kappa_3(BP_n)=n-1$ and $kappa_3(EA_n)=n-1$.","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43748917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Domination number and feedback vertex number of complements of line graphs 线形图补的支配数和反馈顶点数
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-11-08 DOI: 10.1080/09728600.2022.2142863
Xiaohong Chen, Baoyindureng Wu
{"title":"Domination number and feedback vertex number of complements of line graphs","authors":"Xiaohong Chen, Baoyindureng Wu","doi":"10.1080/09728600.2022.2142863","DOIUrl":"https://doi.org/10.1080/09728600.2022.2142863","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80646979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Wiener index of graphs over rings: a survey 环上图的维纳指数:综述
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-11-04 DOI: 10.1080/09728600.2022.2140088
T. Asir, V. Rabikka, A. M. Antó, N. Shunmugapriya
{"title":"Wiener index of graphs over rings: a survey","authors":"T. Asir, V. Rabikka, A. M. Antó, N. Shunmugapriya","doi":"10.1080/09728600.2022.2140088","DOIUrl":"https://doi.org/10.1080/09728600.2022.2140088","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76129837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信