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

Ars Math. Contemp.最新文献

筛选
英文 中文
Association schemes with a certain type of p-subschemes 具有特定类型p-子方案的关联方案
Ars Math. Contemp. Pub Date : 2020-11-02 DOI: 10.26493/1855-3974.2034.dad
Wasim Abbas, M. Hirasaka
{"title":"Association schemes with a certain type of p-subschemes","authors":"Wasim Abbas, M. Hirasaka","doi":"10.26493/1855-3974.2034.dad","DOIUrl":"https://doi.org/10.26493/1855-3974.2034.dad","url":null,"abstract":"In this article, we focus on association schemes with some properties derived from the orbitals of a transitive permutation group G with a one-point stabilizer H satisfying H  <  N G ( H ) <  N G ( N G ( H )) ⊴  G and | N G ( N G ( H ))| =  p 3 where p is a prime. By a corollary of our main result we obtain some inequality which corresponds to the fact | G  :  N G ( N G ( H ))| ≤  p  + 1 .","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"113 1","pages":"51-60"},"PeriodicalIF":0.0,"publicationDate":"2020-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86078798","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
Dominating sets in finite generalized quadrangles 有限广义四边形中的支配集
Ars Math. Contemp. Pub Date : 2020-11-02 DOI: 10.26493/1855-3974.2106.423
Tamás Héger, Lisa Hernandez Lucas
{"title":"Dominating sets in finite generalized quadrangles","authors":"Tamás Héger, Lisa Hernandez Lucas","doi":"10.26493/1855-3974.2106.423","DOIUrl":"https://doi.org/10.26493/1855-3974.2106.423","url":null,"abstract":"A dominating set in a graph is a set of vertices such that each vertex not in the set has a neighbor in the set. The domination number is the smallest size of a dominating set. We consider this problem in the incidence graph of a generalized quadrangle. We show that the domination number of a generalized quadrangle with parameters s and t is at most 2 s t  + 1 , and we prove that this bound is sharp if s  =  t or if s  =  q  − 1 and t  =  q  + 1 . Moreover, we give a complete classification of smallest dominating sets in generalized quadrangles where s  =  t , and give some general results for small dominating sets in the general case.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"43 1","pages":"61-76"},"PeriodicalIF":0.0,"publicationDate":"2020-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85571605","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
Results on the domination number and the total domination number of Lucas cubes 关于Lucas立方体控制数和总控制数的结果
Ars Math. Contemp. Pub Date : 2020-10-28 DOI: 10.26493/1855-3974.2028.cb4
Zülfükar Saygı
{"title":"Results on the domination number and the total domination number of Lucas cubes","authors":"Zülfükar Saygı","doi":"10.26493/1855-3974.2028.cb4","DOIUrl":"https://doi.org/10.26493/1855-3974.2028.cb4","url":null,"abstract":"Lucas cubes are the special subgraphs of Fibonacci cubes. For small dimensions, their domination numbers are obtained by direct search or integer linear programming. For larger dimensions some bounds on these numbers are given. In this work, we present the exact values of total domination number of small dimensional Lucas cubes and present optimization problems obtained from the degree information of Lucas cubes, whose solutions give better lower bounds on the domination numbers and total domination numbers of Lucas cubes.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"40 1","pages":"25-35"},"PeriodicalIF":0.0,"publicationDate":"2020-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74397674","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
Hamilton cycles in primitive vertex-transitive graphs of order a product of two primes - the case PSL(2, q2) acting on cosets of PGL(2, q) 两个素数积的原始顶点传递图中的Hamilton环——PSL(2, q2)作用于PGL(2, q)的集的情况
Ars Math. Contemp. Pub Date : 2020-10-26 DOI: 10.26493/1855-3974.2163.5df
Shao-Fei Du, Klavdija Kutnar, D. Marušič
{"title":"Hamilton cycles in primitive vertex-transitive graphs of order a product of two primes - the case PSL(2, q2) acting on cosets of PGL(2, q)","authors":"Shao-Fei Du, Klavdija Kutnar, D. Marušič","doi":"10.26493/1855-3974.2163.5df","DOIUrl":"https://doi.org/10.26493/1855-3974.2163.5df","url":null,"abstract":"A step forward is made in a long standing Lovasz problem regarding hamiltonicity of vertex-transitive graphs by showing that every connected vertex-transitive graph of order a product of two primes arising from the group action of the projective special linear group PSL (2,  q 2 ) on cosets of its subgroup isomorphic to the projective general linear group PGL (2,  q ) contains a Hamilton cycle.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"334 1","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2020-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77636170","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}
引用次数: 3
The expansion of a chord diagram and the Genocchi numbers 和弦图的扩展和格勒诺奇数
Ars Math. Contemp. Pub Date : 2020-10-24 DOI: 10.26493/1855-3974.2239.7F1
Tomoki Nakamigawa
{"title":"The expansion of a chord diagram and the Genocchi numbers","authors":"Tomoki Nakamigawa","doi":"10.26493/1855-3974.2239.7F1","DOIUrl":"https://doi.org/10.26493/1855-3974.2239.7F1","url":null,"abstract":"A chord diagram E is a set of chords of a circle such that no pair of chords has a common endvertex. Let v 1 ,  v 2 , …,  v 2 n be a sequence of vertices arranged in clockwise order along a circumference. A chord diagram { v 1 v n  + 1 ,  v 2 v n  + 2 , …,  v n v 2 n } is called an n -crossing and a chord diagram { v 1 v 2 ,  v 3 v 4 , …,  v 2 n  − 1 v 2 n } is called an n -necklace. For a chord diagram E having a 2 -crossing S  = { x 1 x 3 ,  x 2 x 4 } , the expansion of E with respect to S is to replace E with E 1  = ( E    S ) ∪ { x 2 x 3 ,  x 4 x 1 } or E 2  = ( E    S ) ∪ { x 1 x 2 ,  x 3 x 4 } . Beginning from a given chord diagram E as the root, by iterating chord expansions in both ways, we have a binary tree whose all leaves are nonintersecting chord diagrams. Let NCD ( E ) be the multiset of the leaves. In this paper, the multiplicity of an n -necklace in NCD ( E ) is studied. Among other results, it is shown that the multiplicity of an n -necklace generated from an n -crossing equals the Genocchi number when n is odd and the median Genocchi number when n is even.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"21 1","pages":"381-391"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73254152","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}
引用次数: 3
The complete bipartite graphs which have exactly two orientably edge-transitive embeddings 具有两个可定向边传递嵌入的完全二部图
Ars Math. Contemp. Pub Date : 2020-10-23 DOI: 10.26493/1855-3974.1900.cc1
Xue Yu, B. Lou, Wenwen Fan
{"title":"The complete bipartite graphs which have exactly two orientably edge-transitive embeddings","authors":"Xue Yu, B. Lou, Wenwen Fan","doi":"10.26493/1855-3974.1900.cc1","DOIUrl":"https://doi.org/10.26493/1855-3974.1900.cc1","url":null,"abstract":"In 2018, Fan and Li classified the complete bipartite graph K m ,  n that has a unique orientably edge-transitive embedding. In this paper, we extend this to give a complete classification of K m ,  n which have exactly two orientably edge-transitive embeddings.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"1 1","pages":"371-379"},"PeriodicalIF":0.0,"publicationDate":"2020-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79871160","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}
引用次数: 4
Schur numbers involving rainbow colorings 涉及彩虹色的舒尔数
Ars Math. Contemp. Pub Date : 2020-10-21 DOI: 10.26493/1855-3974.2019.30b
Mark Budden
{"title":"Schur numbers involving rainbow colorings","authors":"Mark Budden","doi":"10.26493/1855-3974.2019.30b","DOIUrl":"https://doi.org/10.26493/1855-3974.2019.30b","url":null,"abstract":"In this paper, we introduce two different generalizations of Schur numbers that involve rainbow colorings. Motivated by well-known generalizations of Ramsey numbers, we first define the rainbow Schur number R S ( n ) to be the minimum number of colors needed such that every coloring of {1, 2, …,  n } , in which all available colors are used, contains a rainbow solution to a  +  b  =  c . It is shown that $$RS(n)=floor{log _2(n)}+2, quad mbox{for all } nge 3.$$ Second, we consider the Gallai-Schur number G S ( n ) , defined to be the least natural number such that every n -coloring of {1, 2, …,  G S ( n )} that lacks rainbow solutions to the equation a  +  b  =  c necessarily contains a monochromatic solution to this equation. By connecting this number with the n -color Gallai-Ramsey number for triangles, it is shown that for all n  ≥ 3 , $$GS(n)=left{ begin{array}{ll} 5^k & mbox{if} n=2k 2cdot 5^k & mbox{if} n=2k+1.end{array} right.$$","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"357 1","pages":"281-288"},"PeriodicalIF":0.0,"publicationDate":"2020-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76508778","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}
引用次数: 4
Properties of double Roman domination on cardinal products of graphs 图的基积上的双罗马支配的性质
Ars Math. Contemp. Pub Date : 2020-10-20 DOI: 10.26493/1855-3974.2022.44A
A. Klobučar, A. Klobucar
{"title":"Properties of double Roman domination on cardinal products of graphs","authors":"A. Klobučar, A. Klobucar","doi":"10.26493/1855-3974.2022.44A","DOIUrl":"https://doi.org/10.26493/1855-3974.2022.44A","url":null,"abstract":"Double Roman domination is a stronger version of Roman domination that doubles the protection. The areas now have 0 , 1 , 2 or 3 legions. Every attacked area needs 2 legions for its defence, either their own, or borrowed from 1 or 2 neighbouring areas, which still have to keep at least 1 legion to themselves. The minimal number of legions in all areas together is equal to the double Roman domination number. In this paper we determine an upper bound and a lower bound for double Roman domination numbers on cardinal product of any two graphs. Also we determine the exact values of double Roman domination numbers on P 2  ×  G (for many types of graph G ). Also, the double Roman domination number is found for P 2  ×  P n , P 3  ×  P n , P 4  ×  P n , while upper and lower bounds are given for P 5  ×  P n and P 6  ×  P n . Finally, we will give a case study to determine the efficiency of double protection. We will compare double Roman domination versus Roman domination by running a simulation of a battle.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"12 1","pages":"337-349"},"PeriodicalIF":0.0,"publicationDate":"2020-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86279637","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}
引用次数: 5
Sums of r-Lah numbers and r-Lah polynomials r-Lah数和r-Lah多项式的和
Ars Math. Contemp. Pub Date : 2020-10-19 DOI: 10.26493/1855-3974.1793.C4D
Gábor Nyul, G. Rácz
{"title":"Sums of r-Lah numbers and r-Lah polynomials","authors":"Gábor Nyul, G. Rácz","doi":"10.26493/1855-3974.1793.C4D","DOIUrl":"https://doi.org/10.26493/1855-3974.1793.C4D","url":null,"abstract":"The total number of partitions of a finite set into nonempty ordered subsets such that r distinguished elements belong to distinct ordered blocks can be described as sums of r -Lah numbers. In this paper we study this possible variant of Bell-like numbers, as well as the related r -Lah polynomials.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"18 1","pages":"211-222"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90404879","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}
引用次数: 10
Generation of local symmetry-preserving operations on polyhedra 多面体上局部对称保持运算的生成
Ars Math. Contemp. Pub Date : 2020-10-19 DOI: 10.26493/1855-3974.1931.9CF
Pieter Goetschalckx, K. Coolsaet, N. Cleemput
{"title":"Generation of local symmetry-preserving operations on polyhedra","authors":"Pieter Goetschalckx, K. Coolsaet, N. Cleemput","doi":"10.26493/1855-3974.1931.9CF","DOIUrl":"https://doi.org/10.26493/1855-3974.1931.9CF","url":null,"abstract":"We introduce a new practical and more general definition of local symmetry-preserving operations on polyhedra. These can be applied to arbitrary embedded graphs and result in embedded graphs with the same or higher symmetry. With some additional properties we can restrict the connectivity, e.g. when we only want to consider polyhedra. Using some base structures and a list of 10 extensions, we can generate all possible local symmetry-preserving operations isomorph-free.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"8 1","pages":"223-239"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78483137","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信