发布求助
文献互助 智能选刊 最新文献

AKCE International Journal of Graphs and Combinatorics最新文献

筛选
英文 中文
Broadcast domination of lexicographic and modular products of graphs 广播统治的词典和图形的模块化产品
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-07-04 DOI: 10.1080/09728600.2022.2093145
Jishnu Sen, S. Kola
{"title":"Broadcast domination of lexicographic and modular products of graphs","authors":"Jishnu Sen, S. Kola","doi":"10.1080/09728600.2022.2093145","DOIUrl":"https://doi.org/10.1080/09728600.2022.2093145","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"47 1","pages":"177-181"},"PeriodicalIF":1.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90224604","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
Binding number and path-factor critical deleted graphs 绑定数和路径因子关键删除图
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-07-04 DOI: 10.1080/09728600.2022.2094299
Yuan Chen, Guowei Dai
{"title":"Binding number and path-factor critical deleted graphs","authors":"Yuan Chen, Guowei Dai","doi":"10.1080/09728600.2022.2094299","DOIUrl":"https://doi.org/10.1080/09728600.2022.2094299","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"52 1","pages":"197-200"},"PeriodicalIF":1.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88264123","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}
引用次数: 4
Truly non-trivial graphoidal graphs 真正的非平凡图
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-06-30 DOI: 10.1080/09728600.2022.2077674
Rajesh Singh, Purnima Gupta, S. Arumugam
{"title":"Truly non-trivial graphoidal graphs","authors":"Rajesh Singh, Purnima Gupta, S. Arumugam","doi":"10.1080/09728600.2022.2077674","DOIUrl":"https://doi.org/10.1080/09728600.2022.2077674","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"127 1","pages":"112-117"},"PeriodicalIF":1.0,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73382059","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
On the spread of the geometric-arithmetic matrix of graphs 论图的几何算术矩阵的展开
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-06-22 DOI: 10.1080/09728600.2022.2088315
B. Rather, M. Aouchiche, S. Pirzada
{"title":"On the spread of the geometric-arithmetic matrix of graphs","authors":"B. Rather, M. Aouchiche, S. Pirzada","doi":"10.1080/09728600.2022.2088315","DOIUrl":"https://doi.org/10.1080/09728600.2022.2088315","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"43 1","pages":"146-153"},"PeriodicalIF":1.0,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80234105","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}
引用次数: 2
Sudoku number of graphs 数独数图
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-06-16 DOI: 10.1080/09728600.2023.2218917
G. Lau, J. M. Jeyaseeli, W. Shiu, S. Arumugam
{"title":"Sudoku number of graphs","authors":"G. Lau, J. M. Jeyaseeli, W. Shiu, S. Arumugam","doi":"10.1080/09728600.2023.2218917","DOIUrl":"https://doi.org/10.1080/09728600.2023.2218917","url":null,"abstract":"We introduce a new concept in graph coloring motivated by the popular Sudoku puzzle. Let $G=(V,E)$ be a graph of order $n$ with chromatic number $chi(G)=k$ and let $Ssubseteq V.$ Let $mathscr C_0$ be a $k$-coloring of the induced subgraph $G[S].$ The coloring $mathscr C_0$ is called an extendable coloring if $mathscr C_0$ can be extended to a $k$-coloring of $G.$ We say that $mathscr C_0$ is a Sudoku coloring of $G$ if $mathscr C_0$ can be uniquely extended to a $k$-coloring of $G.$ The smallest order of such an induced subgraph $G[S]$ of $G$ which admits a Sudoku coloring is called the Sudoku number of $G$ and is denoted by $sn(G).$ In this paper we initiate a study of this parameter. We first show that this parameter is related to list coloring of graphs. In Section 2, basic properties of Sudoku coloring that are related to color dominating vertices, chromatic numbers and degree of vertices, are given. Particularly, we obtained necessary conditions for $mathscr C_0$ being uniquely extendable, and for $mathscr C_0$ being a Sudoku coloring. In Section 3, we determined the Sudoku number of various familes of graphs. Particularly, we showed that a connected graph $G$ has $sn(G)=1$ if and only if $G$ is bipartite. Consequently, every tree $T$ has $sn(T)=1$. Moreover, a graph $G$ with small chromatic number may have arbitrarily large Sudoku number. Extendable coloring and Sudoku coloring are nice tools for providing a $k$-coloring of $G$.","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":" ","pages":""},"PeriodicalIF":1.0,"publicationDate":"2022-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45635141","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}
引用次数: 3
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs 图的字典积的L(2,1)-着色和不可约无孔着色
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-06-14 DOI: 10.1080/09728600.2022.2084355
Nibedita Mandal, P. Panigrahi
{"title":"L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs","authors":"Nibedita Mandal, P. Panigrahi","doi":"10.1080/09728600.2022.2084355","DOIUrl":"https://doi.org/10.1080/09728600.2022.2084355","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"1 1","pages":"133-140"},"PeriodicalIF":1.0,"publicationDate":"2022-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74478506","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
Two extensions of Leech labeling to the class of all graphs 对所有图类的Leech标记的两个扩展
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-06-08 DOI: 10.1080/09728600.2022.2084354
Seena Varghese, S. Lakshmanan, S. Arumugam
{"title":"Two extensions of Leech labeling to the class of all graphs","authors":"Seena Varghese, S. Lakshmanan, S. Arumugam","doi":"10.1080/09728600.2022.2084354","DOIUrl":"https://doi.org/10.1080/09728600.2022.2084354","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"400 1","pages":"159-165"},"PeriodicalIF":1.0,"publicationDate":"2022-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79806909","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
Decomposition of hypercube graphs into paths and cycles of length four 将超立方图分解为长度为4的路径和循环
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-06-06 DOI: 10.1080/09728600.2022.2084356
D. Saranya, S. Jeevadoss
{"title":"Decomposition of hypercube graphs into paths and cycles of length four","authors":"D. Saranya, S. Jeevadoss","doi":"10.1080/09728600.2022.2084356","DOIUrl":"https://doi.org/10.1080/09728600.2022.2084356","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"79 1","pages":"141-145"},"PeriodicalIF":1.0,"publicationDate":"2022-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83910104","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
A hyperedge coloring and application in combinatorial testing 超边缘着色及其在组合测试中的应用
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-05-31 DOI: 10.1080/09728600.2022.2081523
Yasmeen Akhtar
{"title":"A hyperedge coloring and application in combinatorial testing","authors":"Yasmeen Akhtar","doi":"10.1080/09728600.2022.2081523","DOIUrl":"https://doi.org/10.1080/09728600.2022.2081523","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"25 1","pages":"125-132"},"PeriodicalIF":1.0,"publicationDate":"2022-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82606172","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
On the metric dimension of Cayley graphs 关于Cayley图的度量维数
IF 1 4区 数学
AKCE International Journal of Graphs and Combinatorics Pub Date : 2022-05-30 DOI: 10.1080/09728600.2022.2077675
Afsaneh Rezaei, K. Khashyarmanesh, M. Afkhami
{"title":"On the metric dimension of Cayley graphs","authors":"Afsaneh Rezaei, K. Khashyarmanesh, M. Afkhami","doi":"10.1080/09728600.2022.2077675","DOIUrl":"https://doi.org/10.1080/09728600.2022.2077675","url":null,"abstract":"","PeriodicalId":48497,"journal":{"name":"AKCE International Journal of Graphs and Combinatorics","volume":"18 1","pages":"118-124"},"PeriodicalIF":1.0,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91226264","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
首页 上一页 下一页 尾页
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学术官方微信