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

Discrete Mathematics & Theoretical Computer Science最新文献

筛选
英文 中文
Leanness Computation: Small Values and Special Graph Classes 精益计算：小值和特殊图类
Discrete Mathematics & Theoretical Computer Science Pub Date : 2024-07-08 DOI: 10.46298/dmtcs.12544
David Coudert, Samuel Coulomb, G. Ducoffe
{"title":"Leanness Computation: Small Values and Special Graph Classes","authors":"David Coudert, Samuel Coulomb, G. Ducoffe","doi":"10.46298/dmtcs.12544","DOIUrl":"https://doi.org/10.46298/dmtcs.12544","url":null,"abstract":"Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k. The leanness of G is the maximum diameter of a slice. This metric graph invariant has been studied under different names, such as \"interval thinness\" and \"fellow traveler property\". Graphs with leanness equal to 0, a.k.a. geodetic graphs, also have received special attention in Graph Theory. The practical computation of leanness in real-life complex networks has been studied recently (Mohammed et al., COMPLEX NETWORKS'21). In this paper, we give a finer-grained complexity analysis of two related problems, namely: deciding whether the leanness of a graph G is at most some small value ℓ; and computing the leanness on specific graph classes. We obtain improved algorithms in some cases, and time complexity lower bounds under plausible hypotheses.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"109 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141667314","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
On the protected nodes in exponential recursive trees 关于指数递归树中的受保护节点
Discrete Mathematics & Theoretical Computer Science Pub Date : 2024-01-11 DOI: 10.46298/dmtcs.10524
M. Javanian, Rafik Aguech
{"title":"On the protected nodes in exponential recursive trees","authors":"M. Javanian, Rafik Aguech","doi":"10.46298/dmtcs.10524","DOIUrl":"https://doi.org/10.46298/dmtcs.10524","url":null,"abstract":"The exponential recursive trees model several kinds of networks. At each step of growing of these trees, each node independently attracts a new node with probability p, or fails to do with probability 1 − p. Here, we investigate the number of protected nodes, total path length of protected nodes, and a mean study of the protected node profile of such trees.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":" 7","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139627132","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
Inversion sequences avoiding 021 and another pattern of length four 避免使用 021 和另一个长度为 4 的图案的反转序列
Discrete Mathematics & Theoretical Computer Science Pub Date : 2023-11-17 DOI: 10.46298/dmtcs.10444
Toufik Mansour, Gökhan Yıldırım
{"title":"Inversion sequences avoiding 021 and another pattern of length four","authors":"Toufik Mansour, Gökhan Yıldırım","doi":"10.46298/dmtcs.10444","DOIUrl":"https://doi.org/10.46298/dmtcs.10444","url":null,"abstract":"We study the enumeration of inversion sequences that avoid the pattern 021 and another pattern of length four. We determine the generating trees for all possible pattern pairs and compute the corresponding generating functions. We introduce the concept of dregular generating trees and conjecture that for any 021-avoiding pattern τ , the generating tree T ({021, τ }) is d-regular for some integer d.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"33 6","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139263480","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
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows 从分支到流动:弧不相交分支流动的类Edmonds性质研究
Discrete Mathematics & Theoretical Computer Science Pub Date : 2023-05-02 DOI: 10.46298/dmtcs.9302
Cláudio Carvalho, J. Costa, Raul Lopes, A. K. Maia, N. Nisse, C. Sales
{"title":"From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows","authors":"Cláudio Carvalho, J. Costa, Raul Lopes, A. K. Maia, N. Nisse, C. Sales","doi":"10.46298/dmtcs.9302","DOIUrl":"https://doi.org/10.46298/dmtcs.9302","url":null,"abstract":"An s-branching flow f in a network N = (D, u), where u is the capacity function, is a flow thatreaches every vertex in V(D) from s while loosing exactly one unit of flow in each vertex other thans. Bang-Jensen and Bessy [TCS, 2014] showed that, when every arc has capacity n − 1, a network Nadmits k arc-disjoint s-branching flows if and only if its associated digraph D contains k arc-disjoints-branchings. Thus a classical result by Edmonds stating that a digraph contains k arc-disjoints-branchings if and only if the indegree of every set X ⊆ V (D) {s} is at least k also characterizesthe existence of k arc-disjoint s-branching flows in those networks, suggesting that the larger thecapacities are, the closer an s-branching flow is from simply being an s-branching. This observationis further implied by results by Bang-Jensen et al. [DAM, 2016] showing that there is a polynomialalgorithm to find the flows (if they exist) when every arc has capacity n − c, for every fixed c ≥ 1,and that such an algorithm is unlikely to exist for most other choices of the capacities. In this paper,we investigate how a property that is a natural extension of the characterization by Edmonds’ relatesto the existence of k arc-disjoint s-branching flows in networks. Although this property is alwaysnecessary for the existence of the flows, we show that it is not always sufficient and that it is hardto decide if the desired flows exist even if we know beforehand that the network satisfies it. On thepositive side, we show that it guarantees the existence of the desired flows in some particular casesdepending on the choice of the capacity function or on the structure of the underlying graph of D,for example. We remark that, in those positive cases, polynomial time algorithms to find the flowscan be extracted from the constructive proofs.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115493689","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
Maker-Breaker domination game on trees when Staller wins 当Staller获胜时，在树上的Maker-Breaker统治游戏
Discrete Mathematics & Theoretical Computer Science Pub Date : 2022-12-13 DOI: 10.46298/dmtcs.10515
Csilla Bujt'as, Pakanun Dokyeesun, Sandi Klavvzar
{"title":"Maker-Breaker domination game on trees when Staller wins","authors":"Csilla Bujt'as, Pakanun Dokyeesun, Sandi Klavvzar","doi":"10.46298/dmtcs.10515","DOIUrl":"https://doi.org/10.46298/dmtcs.10515","url":null,"abstract":"In the Maker-Breaker domination game played on a graph $G$, Dominator's goal\u0000is to select a dominating set and Staller's goal is to claim a closed\u0000neighborhood of some vertex. We study the cases when Staller can win the game.\u0000If Dominator (resp., Staller) starts the game, then $gamma_{rm SMB}(G)$\u0000(resp., $gamma_{rm SMB}'(G)$) denotes the minimum number of moves Staller\u0000needs to win. For every positive integer $k$, trees $T$ with $gamma_{rm\u0000SMB}'(T)=k$ are characterized and a general upper bound on $gamma_{rm SMB}'$\u0000is proved. Let $S = S(n_1,dots, n_ell)$ be the subdivided star obtained from\u0000the star with $ell$ edges by subdividing its edges $n_1-1, ldots, n_ell-1$\u0000times, respectively. Then $gamma_{rm SMB}'(S)$ is determined in all the cases\u0000except when $ellge 4$ and each $n_i$ is even. The simplest formula is\u0000obtained when there are at least two odd $n_i$s. If $n_1$ and $n_2$ are the two\u0000smallest such numbers, then $gamma_{rm SMB}'(S(n_1,dots, n_ell))=lceil\u0000log_2(n_1+n_2+1)rceil$. For caterpillars, exact formulas for $gamma_{rm\u0000SMB}$ and for $gamma_{rm SMB}'$ are established.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122391365","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
Rainbow vertex pair-pancyclicity of strongly edge-colored graphs 彩虹顶点对-强边色图的泛环性
Discrete Mathematics & Theoretical Computer Science Pub Date : 2022-10-12 DOI: 10.46298/dmtcs.10142
Peixue Zhao, Fei Huang
{"title":"Rainbow vertex pair-pancyclicity of strongly edge-colored graphs","authors":"Peixue Zhao, Fei Huang","doi":"10.46298/dmtcs.10142","DOIUrl":"https://doi.org/10.46298/dmtcs.10142","url":null,"abstract":"An edge-colored graph is emph{rainbow }if no two edges of the graph have the\u0000same color. An edge-colored graph $G^c$ is called emph{properly colored} if\u0000every two adjacent edges of $G^c$ receive distinct colors in $G^c$. A\u0000emph{strongly edge-colored} graph is a proper edge-colored graph such that\u0000every path of length $3$ is rainbow. We call an edge-colored graph $G^c$\u0000emph{rainbow vertex pair-pancyclic} if any two vertices in $G^c$ are contained\u0000in a rainbow cycle of length $ell$ for each $ell$ with $3 leq ell leq n$.\u0000In this paper, we show that every strongly edge-colored graph $G^c$ of order\u0000$n$ with minimum degree $delta geq frac{2n}{3}+1$ is rainbow vertex\u0000pair-pancyclicity.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117208936","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
Several Roman domination graph invariants on Kneser graphs Kneser图上的几个罗马统治图不变量
Discrete Mathematics & Theoretical Computer Science Pub Date : 2022-04-12 DOI: 10.46298/dmtcs.10506
Tatjana Zec, Milana Grbi'c
{"title":"Several Roman domination graph invariants on Kneser graphs","authors":"Tatjana Zec, Milana Grbi'c","doi":"10.46298/dmtcs.10506","DOIUrl":"https://doi.org/10.46298/dmtcs.10506","url":null,"abstract":"This paper considers the following three Roman domination graph invariants on\u0000Kneser graphs:\u0000 Roman domination, total Roman domination, and signed Roman domination.\u0000 For Kneser graph $K_{n,k}$, we present exact values for Roman domination\u0000number $gamma_{R}(K_{n,k})$ and total Roman domination number\u0000$gamma_{tR}(K_{n,k})$ proving that for $ngeqslant k(k+1)$,\u0000$gamma_{R}(K_{n,k}) =gamma_{tR}(K_{n,k}) = 2(k+1)$. For signed Roman\u0000domination number $gamma_{sR}(K_{n,k})$, the new lower and upper bounds for\u0000$K_{n,2}$ are provided: we prove that for $ngeqslant 12$, the lower bound is\u0000equal to 2, while the upper bound depends on the parity of $n$ and is equal to\u00003 if $n$ is odd, and equal to $5$ if $n$ is even. For graphs of smaller\u0000dimensions, exact values are found by applying exact methods from literature.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115220642","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
Extremal problems of double stars 双星的极端问题
Discrete Mathematics & Theoretical Computer Science Pub Date : 2021-09-03 DOI: 10.46298/dmtcs.8499
Ervin GyHori, Runze Wang, Spencer Woolfson
{"title":"Extremal problems of double stars","authors":"Ervin GyHori, Runze Wang, Spencer Woolfson","doi":"10.46298/dmtcs.8499","DOIUrl":"https://doi.org/10.46298/dmtcs.8499","url":null,"abstract":"In a generalized Tur'an problem, two graphs $H$ and $F$ are given and the\u0000question is the maximum number of copies of $H$ in an $F$-free graph of order\u0000$n$. In this paper, we study the number of double stars $S_{k,l}$ in\u0000triangle-free graphs. We also study an opposite version of this question: what\u0000is the maximum number edges/triangles in graphs with double star type\u0000restrictions, which leads us to study two questions related to the extremal\u0000number of triangles or edges in graphs with degree-sum constraints over\u0000adjacent or non-adjacent vertices.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124267339","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
The Variance and the Asymptotic Distribution of the Length of Longest $k$-alternating Subsequences 最长k -交替子序列长度的方差和渐近分布
Discrete Mathematics & Theoretical Computer Science Pub Date : 2021-07-26 DOI: 10.46298/dmtcs.10296
Altar cCicceksiz, Yunus Emre Demirci, Umit Icslak
{"title":"The Variance and the Asymptotic Distribution of the Length of Longest $k$-alternating Subsequences","authors":"Altar cCicceksiz, Yunus Emre Demirci, Umit Icslak","doi":"10.46298/dmtcs.10296","DOIUrl":"https://doi.org/10.46298/dmtcs.10296","url":null,"abstract":"We obtain an explicit formula for the variance of the number of $k$-peaks in\u0000a uniformly random permutation. This is then used to obtain an asymptotic\u0000formula for the variance of the length of longest $k$-alternating subsequence\u0000in random permutations. Also a central limit is proved for the latter\u0000statistic.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124493807","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
Bijective proofs for Eulerian numbers of types B and D B和D型欧拉数的双客观证明
Discrete Mathematics & Theoretical Computer Science Pub Date : 2021-04-26 DOI: 10.46298/dmtcs.7413
L. Santocanale
{"title":"Bijective proofs for Eulerian numbers of types B and D","authors":"L. Santocanale","doi":"10.46298/dmtcs.7413","DOIUrl":"https://doi.org/10.46298/dmtcs.7413","url":null,"abstract":"Let $Bigllanglematrix{ncr k}Bigrrangle$, $Bigllanglematrix{B_ncr\u0000k}Bigrrangle$, and $Bigllanglematrix{D_ncr k}Bigrrangle$ be the\u0000Eulerian numbers in the types A, B, and D, respectively -- that is, the number\u0000of permutations of n elements with $k$ descents, the number of signed\u0000permutations (of $n$ elements) with $k$ type B descents, the number of even\u0000signed permutations (of $n$ elements) with $k$ type D descents. Let $S_n(t) =\u0000sum_{k = 0}^{n-1} Bigllanglematrix{ncr k}Bigrrangle t^k$, $B_n(t) =\u0000sum_{k = 0}^n Bigllanglematrix{B_ncr k}Bigrrangle t^k$, and $D_n(t) =\u0000sum_{k = 0}^n Bigllanglematrix{D_ncr k}Bigrrangle t^k$. We give\u0000bijective proofs of the identity $$B_n(t^2) = (1 + t)^{n+1}S_n(t) - 2^n\u0000tS_n(t^2)$$ and of Stembridge's identity $$D_n(t) = B_n(t) -\u0000n2^{n-1}tS_{n-1}(t).$$ These bijective proofs rely on a representation of\u0000signed permutations as paths. Using this representation we also establish a\u0000bijective correspondence between even signed permutations and pairs $(w, E)$\u0000with $([n], E)$ a threshold graph and $w$ a degree ordering of $([n], E)$,\u0000which we use to obtain bijective proofs of enumerative results for threshold\u0000graphs.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133511708","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
下一页 尾页
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学术官方微信