Ars Comb.Pub Date : 2011-01-01DOI: 10.55937/sut/1315095084
M. Bataineh, M. Jaradat, I. Al-Shboul
{"title":"Edge-Maximal Graphs Without θ5-Graphs","authors":"M. Bataineh, M. Jaradat, I. Al-Shboul","doi":"10.55937/sut/1315095084","DOIUrl":"https://doi.org/10.55937/sut/1315095084","url":null,"abstract":"","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134200978","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}
Ars Comb.Pub Date : 2008-12-01DOI: 10.29850/LTJ.200812.0011
Hung-Chih Lee
{"title":"Packing and Covering Complete Bipartite Multidigraphs with 6-circuits","authors":"Hung-Chih Lee","doi":"10.29850/LTJ.200812.0011","DOIUrl":"https://doi.org/10.29850/LTJ.200812.0011","url":null,"abstract":"Let C(subscript k) denote a circuit of length k. In a multidigraph G, a C(subscript k)-packing is a set P={G1, G2,…, G(subscript s)} of arc-disjoint subdigraphs of G such that each G(subscript i) is isomorphic to C(subscript k), and a C(subscript k)-packing is maximum if it has the maximum number of members among all packings; a C(subscript k)-covering is a set R={G1, G2,…, G(subscript t)} of subdigraphs of G such that each G(subscript i) is isomorphic to C(subscript k) and every arc of G appears in at least one member of R, and a C(subscript k) covering is minimum if it has the minimum number of members among all coverings. In this paper the problem for finding a maximum C4-packing and a minimum C4-covering of the complete bipartite multidigraph is solved.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126830709","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}
Ars Comb.Pub Date : 2007-04-01DOI: 10.55937/sut/1252510544
Zeev Nutov, M. Tsugaki
{"title":"On (t, k)-shredders in k-connected graphs","authors":"Zeev Nutov, M. Tsugaki","doi":"10.55937/sut/1252510544","DOIUrl":"https://doi.org/10.55937/sut/1252510544","url":null,"abstract":"Let G = (V, E) be a k-connected graph. For t >= 3 a subset T subset of V is a (t, k)-shredder if vertical bar T vertical bar = k and G - T has at least t connected components. It is known that the number of (t, k)-shredders in a k-connected graph on n nodes is less than 2n/(2t - 3). We show a slightly better bound for the case k <= 2t - 3.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114861894","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}
Ars Comb.Pub Date : 2004-08-17DOI: 10.1007/978-3-540-27798-9_18
L. Chandran, N. Narayanaswamy
{"title":"On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts","authors":"L. Chandran, N. Narayanaswamy","doi":"10.1007/978-3-540-27798-9_18","DOIUrl":"https://doi.org/10.1007/978-3-540-27798-9_18","url":null,"abstract":"","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123409164","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}
Ars Comb.Pub Date : 1995-05-01DOI: 10.1137/S0895480191197234
J. Lundgren, Patricia A. McKenna, Larry J. Langley, Sarah K. Merz, Craig W. Rasmussen
{"title":"The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs","authors":"J. Lundgren, Patricia A. McKenna, Larry J. Langley, Sarah K. Merz, Craig W. Rasmussen","doi":"10.1137/S0895480191197234","DOIUrl":"https://doi.org/10.1137/S0895480191197234","url":null,"abstract":"A radio communication network can be modeled by a digraph, $D$, where there is an arc from vertex $x$ to vertex $y$ if a signal sent from $x$ can be received at $y$. The competition graph, $C(D)$, of this network has the same vertex set as $D$, and $(x, y)$ is an edge in $C(D)$ if there is a vertex $z$ such that $(x, z)$ and $(y, z)$ are arcs in $D$. The competition graph can be used to assist in assigning frequencies to the transmitters in the network. Usually the digraphs for these networks are strongly connected, but the power of transmitters may vary, so they are not necessarily symmetric. Therefore it is of interest to determine which graphs are the competition graphs of strongly connected digraphs. We characterize these graphs as well as establish several large classes of graphs, including chordal, interval, and some triangle-free graphs, which are competition graphs of loopless Hamiltonian digraphs.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129402996","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}
Ars Comb.Pub Date : 1900-01-01DOI: 10.21236/ada262423
Michael R. Pinter
{"title":"A Class Of Well-Covered Graphs With Girth Four","authors":"Michael R. Pinter","doi":"10.21236/ada262423","DOIUrl":"https://doi.org/10.21236/ada262423","url":null,"abstract":"Abstract : A graph is well-covered if every maximal independent set is also a maximum independent set. A 1-well-covered graph G has the additional property that G-v is also well-covered for every point v in G. Thus, the 1-well-covered graphs form a subclass of the well-covered graphs. We examine triangle-free 1- well-covered graphs. Other than C5 and K2, a 1-well-covered graph must contain a triangle or a 4-cycle. Thus, the graphs we consider have girth 4. Two constructions are given which yield infinite families of 1-well-covered graphs with girth 4. These families contain graphs with arbitrarily large independence number.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114690194","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}
Ars Comb.Pub Date : 1900-01-01DOI: 10.7282/T38P6446
Sarmad Abbasi
{"title":"On the genus of the star graphs","authors":"Sarmad Abbasi","doi":"10.7282/T38P6446","DOIUrl":"https://doi.org/10.7282/T38P6446","url":null,"abstract":"","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130688869","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}
Ars Comb.Pub Date : 1900-01-01DOI: 10.1155/S0161171202011444
Dong Geon Kim
{"title":"A Decoding Scheme for the 4-ary Lexicodes with dm=4","authors":"Dong Geon Kim","doi":"10.1155/S0161171202011444","DOIUrl":"https://doi.org/10.1155/S0161171202011444","url":null,"abstract":"We introduce the algorithms for basis and decoding of quaternary lexicographic codes with minimum distance d=3 for an arbitrary length n.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133331380","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}
Ars Comb.Pub Date : 1900-01-01DOI: 10.28919/jmcs/5745
K. Uslu, N. Taskara, Hasan Köse
{"title":"The Generalized k-Fibonacci and k-Lucas Numbers","authors":"K. Uslu, N. Taskara, Hasan Köse","doi":"10.28919/jmcs/5745","DOIUrl":"https://doi.org/10.28919/jmcs/5745","url":null,"abstract":"","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114590817","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}
Ars Comb.Pub Date : 1900-01-01DOI: 10.1017/CBO9780511542985.012
G. Isaak, Kathryn L. Nyman, Ann N. Trenk
{"title":"A Hierarchy of Classes of Bounded Bitolerance Orders","authors":"G. Isaak, Kathryn L. Nyman, Ann N. Trenk","doi":"10.1017/CBO9780511542985.012","DOIUrl":"https://doi.org/10.1017/CBO9780511542985.012","url":null,"abstract":"In this paper we extend the work of Bogart and Trenk [3] and Fishburn and Trotter [6] in studying different classes of bitolerance orders. We provide a more comprehensive list of classes of bitolerance orders and prove equality between some of these classes in general and other classes in the bipartite domain. We also provide separating examples between unequal classes of bitolerance orders.","PeriodicalId":378960,"journal":{"name":"Ars Comb.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132648301","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}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：