首页 > 最新文献

离散数学期刊(英文)最新文献

英文 中文
The g-Good-Neighbor Connectivity of Some Cartesian Product Graphs 某些笛卡尔积图的g-近邻连通性
Pub Date : 2023-01-01 DOI: 10.4236/ojdm.2023.131003
Yinkui Li, Ting Xie, Xiaoxiao Qin
{"title":"The <i>g</i>-Good-Neighbor Connectivity of Some Cartesian Product Graphs","authors":"Yinkui Li, Ting Xie, Xiaoxiao Qin","doi":"10.4236/ojdm.2023.131003","DOIUrl":"https://doi.org/10.4236/ojdm.2023.131003","url":null,"abstract":"","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70627811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Solving the k-Independent Sets Problem of Graphs by Gröbner Bases 用Gröbner基求解图的k独立集问题
Pub Date : 2023-01-01 DOI: 10.4236/ojdm.2023.133008
Junyu Luo, S. Ding
{"title":"Solving the <i>k</i>-Independent Sets Problem of Graphs by Gröbner Bases","authors":"Junyu Luo, S. Ding","doi":"10.4236/ojdm.2023.133008","DOIUrl":"https://doi.org/10.4236/ojdm.2023.133008","url":null,"abstract":"","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70627599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Novel Design Method for Protein-Like Molecules from the Perspective of Sheaf Theory 基于束理论的蛋白质类分子设计新方法
Pub Date : 2023-01-01 DOI: 10.4236/ojdm.2023.133007
Naoto Morikawa
{"title":"A Novel Design Method for Protein-Like Molecules from the Perspective of Sheaf Theory","authors":"Naoto Morikawa","doi":"10.4236/ojdm.2023.133007","DOIUrl":"https://doi.org/10.4236/ojdm.2023.133007","url":null,"abstract":"","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70627462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Relationship between the Partial Bell Polynomials and Alternating Run Polynomials 部分钟多项式与交替行多项式的关系
Pub Date : 2023-01-01 DOI: 10.4236/ojdm.2023.132005
Yanan Feng, Zhe Wang
{"title":"A Relationship between the Partial Bell Polynomials and Alternating Run Polynomials","authors":"Yanan Feng, Zhe Wang","doi":"10.4236/ojdm.2023.132005","DOIUrl":"https://doi.org/10.4236/ojdm.2023.132005","url":null,"abstract":"","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70627445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rupture Degree of Some Cartesian Product Graphs 一些笛卡尔积图的破裂度
Pub Date : 2023-01-01 DOI: 10.4236/ojdm.2023.131002
Yinkui Li, Tingyi Zhu
{"title":"Rupture Degree of Some Cartesian Product Graphs","authors":"Yinkui Li, Tingyi Zhu","doi":"10.4236/ojdm.2023.131002","DOIUrl":"https://doi.org/10.4236/ojdm.2023.131002","url":null,"abstract":"","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70627800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Genome Sequencing Using Graph Theory Approach 利用图论方法进行基因组测序
Pub Date : 2023-01-01 DOI: 10.4236/ojdm.2023.132004
Shepherd Chikomana, Xiaoxue Hu
{"title":"Genome Sequencing Using Graph Theory Approach","authors":"Shepherd Chikomana, Xiaoxue Hu","doi":"10.4236/ojdm.2023.132004","DOIUrl":"https://doi.org/10.4236/ojdm.2023.132004","url":null,"abstract":"","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70627394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Complexity of Injective Homomorphisms to Small Tournaments, and of Injective Oriented Colourings 小锦标赛的注射同态的复杂性和注射定向着色的复杂性
Pub Date : 2022-07-25 DOI: 10.4236/ojdm.2023.131001
Russell Campbell, N. E. Clarke, G. MacGillivray
. Several possible definitions of local injectivity for a homomorphism of an oriented graph G to an oriented graph H are considered. In each case, we determine the complexity of deciding whether there exists such a homomorphism when G is given and H is a fixed tournament on three or fewer vertices. Each possible definition leads to a locally-injective oriented colouring problem. A dichotomy theorem is proved in each case.
.考虑了有向图G到有向图H的同态的局部内射性的几个可能的定义。在每种情况下,当G被给定并且H是三个或更少顶点上的固定锦标赛时,我们确定了决定是否存在这样的同态的复杂性。每一种可能的定义都会导致一个局部内射定向的着色问题。在每种情况下都证明了一个二分法定理。
{"title":"Complexity of Injective Homomorphisms to Small Tournaments, and of Injective Oriented Colourings","authors":"Russell Campbell, N. E. Clarke, G. MacGillivray","doi":"10.4236/ojdm.2023.131001","DOIUrl":"https://doi.org/10.4236/ojdm.2023.131001","url":null,"abstract":". Several possible definitions of local injectivity for a homomorphism of an oriented graph G to an oriented graph H are considered. In each case, we determine the complexity of deciding whether there exists such a homomorphism when G is given and H is a fixed tournament on three or fewer vertices. Each possible definition leads to a locally-injective oriented colouring problem. A dichotomy theorem is proved in each case.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41500608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
3-Anti-Circulant Digraphs Are α-Diperfect and BE-Diperfect 3-反循环有向图是α-双光子和BE双光子
Pub Date : 2022-03-09 DOI: 10.4236/ojdm.2022.123003
Lucas Freitas, Orlando Lee
Let $D$ be a digraph. A subset $S$ of $V(D)$ is a stable set if every pair of vertices in $S$ is non-adjacent in $D$. A collection of disjoint paths $mathcal{P}$ of $D$ is a path partition of $V(D)$, if every vertex in $V(D)$ is exactly on a path of $mathcal{P}$. We say that a stable set $S$ and a path partition $mathcal{P}$ are orthogonal if each path of $P$ contains exactly one vertex of $S$. A digraph $D$ satisfies the $alpha$-property if for every maximum stable set $S$ of $D$, there exists a path partition $mathcal{P}$ such that $S$ and $mathcal{P}$ are orthogonal. A digraph $D$ is $alpha$-diperfect if every induced subdigraph of $D$ satisfies the $alpha$-property. In 1982, Claude Berge proposed a characterization for $alpha$-diperfect digraphs in terms of forbidden anti-directed odd cycles. In 2018, Sambinelli, Silva and Lee proposed a similar conjecture. A digraph $D$ satisfies the Begin-End-property or BE-property if for every maximum stable set $S$ of $D$, there exists a path partition $mathcal{P}$ such that (i) $S$ and $mathcal{P}$ are orthogonal and (ii) for each path $P in mathcal{P}$, either the start or the end of $P$ belongs to $S$. A digraph $D$ is BE-diperfect if every induced subdigraph of $D$ satisfies the BE-property. Sambinelli, Silva and Lee proposed a characterization for BE-diperfect digraphs in terms of forbidden blocking odd cycles. In this paper, we verified both conjectures for $3$-anti-circulant digraphs. We also present some structural results for $alpha$-diperfect and BE-diperfect digraphs.
让$D$是一个有向图。如果$S$中的每对顶点在$D$中是不相邻的,则$V(D)$的子集$S$是稳定集。$D$的不相交路径$mathcal{P}$的集合是$V(D)$的路径分区,如果$V(D)$中的每个顶点都恰好在$mathical{P}$的路径上。我们说稳定集$S$和路径分区$mathcal{P}$是正交的,如果$P$的每条路径恰好包含$S$的一个顶点。有向图$D$满足$alpha$-性质,如果对于$D$的每个最大稳定集$S$,存在一个路径分区$mathcal{P}$,使得$S$和$mathcal{P}$正交。如果$D$的每个诱导子图都满足$alpha$-性质,则有向图$D$是$alpa$-完全有向图。1982年,Claude Berge提出了$alpha$-二完全有向图的一个特征化,用禁止的反定向奇环来表示。2018年,桑比内利、席尔瓦和李提出了类似的猜想。有向图$D$满足Begin-End性质或BE性质,如果对于$D$的每个最大稳定集$S$,存在一个路径分区$mathcal{P}$,使得(i)$S$和$mathical{P}$正交,并且(ii)对于每个路径$Pinmathcal{P}$,$P$的开始或结束都属于$S$。如果$D$的每个诱导子图都满足BE性质,则有向图$D$是BE完全图。Sambinelli、Silva和Lee提出了用禁止阻塞奇环刻画BE完全有向图的一个性质。在本文中,我们验证了$3$-反循环有向图的两个猜想。我们还给出了$alpha$-双完全和BE双完全有向图的一些结构结果。
{"title":"3-Anti-Circulant Digraphs Are <i>α</i>-Diperfect and BE-Diperfect","authors":"Lucas Freitas, Orlando Lee","doi":"10.4236/ojdm.2022.123003","DOIUrl":"https://doi.org/10.4236/ojdm.2022.123003","url":null,"abstract":"Let $D$ be a digraph. A subset $S$ of $V(D)$ is a stable set if every pair of vertices in $S$ is non-adjacent in $D$. A collection of disjoint paths $mathcal{P}$ of $D$ is a path partition of $V(D)$, if every vertex in $V(D)$ is exactly on a path of $mathcal{P}$. We say that a stable set $S$ and a path partition $mathcal{P}$ are orthogonal if each path of $P$ contains exactly one vertex of $S$. A digraph $D$ satisfies the $alpha$-property if for every maximum stable set $S$ of $D$, there exists a path partition $mathcal{P}$ such that $S$ and $mathcal{P}$ are orthogonal. A digraph $D$ is $alpha$-diperfect if every induced subdigraph of $D$ satisfies the $alpha$-property. In 1982, Claude Berge proposed a characterization for $alpha$-diperfect digraphs in terms of forbidden anti-directed odd cycles. In 2018, Sambinelli, Silva and Lee proposed a similar conjecture. A digraph $D$ satisfies the Begin-End-property or BE-property if for every maximum stable set $S$ of $D$, there exists a path partition $mathcal{P}$ such that (i) $S$ and $mathcal{P}$ are orthogonal and (ii) for each path $P in mathcal{P}$, either the start or the end of $P$ belongs to $S$. A digraph $D$ is BE-diperfect if every induced subdigraph of $D$ satisfies the BE-property. Sambinelli, Silva and Lee proposed a characterization for BE-diperfect digraphs in terms of forbidden blocking odd cycles. In this paper, we verified both conjectures for $3$-anti-circulant digraphs. We also present some structural results for $alpha$-diperfect and BE-diperfect digraphs.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46457331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Geodetic Number and Geo-Chromatic Number of 2-Cartesian Product of Some Graphs 某些图的2-笛卡儿积的大地数和地色数
Pub Date : 2022-01-01 DOI: 10.4236/ojdm.2022.121001
M. Huilgol, B. Divya
{"title":"Geodetic Number and Geo-Chromatic Number of 2-Cartesian Product of Some Graphs","authors":"M. Huilgol, B. Divya","doi":"10.4236/ojdm.2022.121001","DOIUrl":"https://doi.org/10.4236/ojdm.2022.121001","url":null,"abstract":"","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70627648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Restabilization Process in Matching Markets with Workers Proposing 工人提议下匹配市场的再稳定过程
Pub Date : 2022-01-01 DOI: 10.4236/ojdm.2022.124007
M. Beatriz
{"title":"Restabilization Process in Matching Markets with Workers Proposing","authors":"M. Beatriz","doi":"10.4236/ojdm.2022.124007","DOIUrl":"https://doi.org/10.4236/ojdm.2022.124007","url":null,"abstract":"","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70627762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
离散数学期刊(英文)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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