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

Discrete Mathematics Letters最新文献

筛选
英文 中文
Szeged-Like Topological Indices and the Efficacy of the Cut Method: The Case of Melem Structures 类Szeged拓扑指数与割方法的有效性——以Melem结构为例
IF 0.8
Discrete Mathematics Letters Pub Date : 2022-02-03 DOI: 10.47443/dml.2021.s209
M. Arockiaraj, Shagufa Mushtaq, S. Klavžar, J. C. Fiona, K. Balasubramanian
{"title":"Szeged-Like Topological Indices and the Efficacy of the Cut Method: The Case of Melem Structures","authors":"M. Arockiaraj, Shagufa Mushtaq, S. Klavžar, J. C. Fiona, K. Balasubramanian","doi":"10.47443/dml.2021.s209","DOIUrl":"https://doi.org/10.47443/dml.2021.s209","url":null,"abstract":"The Szeged index is a bond-additive topological descriptor that quantifies each bond’s terminal atoms based on their closeness sets which is measured by multiplying the number of atoms in the closeness sets. Based on the high correlation between the Szeged index and physico-chemical properties of chemical compounds, Szeged-like indices have been proposed by considering closeness sets with bond counts and other mathematical operations like addition and subtraction. As there are many ways to compute the Szeged-like indices, the cut method is predominantly used due to its complexity compared to other approaches based on algorithms and interpolations. Yet, we here analyze the usefulness of the cut method in the case of melem structures and find that it is less effective when the size and shape of the cavities change in the structures.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48396938","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
On the Wiener Index of Two Families Generated by Joining a Graph to a Tree 图与树连接生成的两族的Wiener索引
IF 0.8
Discrete Mathematics Letters Pub Date : 2022-02-02 DOI: 10.47443/dml.2021.s208
A. Dobrynin
{"title":"On the Wiener Index of Two Families Generated by Joining a Graph to a Tree","authors":"A. Dobrynin","doi":"10.47443/dml.2021.s208","DOIUrl":"https://doi.org/10.47443/dml.2021.s208","url":null,"abstract":"The Wiener index W (G) of a graph G is the sum of distances between all vertices of G. The Wiener index of a family of connected graphs is defined as the sum of the Wiener indices of its members. Two families of graphs can be constructed by identifying a fixed vertex of an arbitrary graph F with vertices or subdivision vertices of an arbitrary tree T of order n. Let Gv be a graph obtained by identifying a fixed vertex of F with a vertex v of T . The first family V = {Gv | v ∈ V (T )} contains n graphs. Denote by Gve a graph obtained by identifying the same fixed vertex of F with the subdivision vertex ve of an edge e in T . The second family E = {Gve | e ∈ E(T )} contains n − 1 graphs. It is proved that W (V) = W (E) if and only if W (F ) = 2W (T ).","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45119899","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
Some Explicit Expressions for Twisted q-Analogues of Catalan Numbers and Polynomials Catalan数和多项式的扭曲q-类似物的一些显式表达式
IF 0.8
Discrete Mathematics Letters Pub Date : 2022-01-28 DOI: 10.47443/dml.2022.0007
D. Lim
{"title":"Some Explicit Expressions for Twisted q-Analogues of Catalan Numbers and Polynomials","authors":"D. Lim","doi":"10.47443/dml.2022.0007","DOIUrl":"https://doi.org/10.47443/dml.2022.0007","url":null,"abstract":"Abstract In this paper, the author considers the twisted q-analogues of Catalan numbers, which are arisen from the fermionic p-adic q-integrals. By using the fermionic p-adic q-integrals or generating functions, some explicit identities and properties for the twisted q-analogues of Catalan numbers and polynomials are given.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45803141","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
Extremal Trees for the Geometric-Arithmetic Index with the Maximum Degree 极大次几何算术索引的极值树
IF 0.8
Discrete Mathematics Letters Pub Date : 2022-01-27 DOI: 10.47443/dml.2021.s207
A. Divya, A. Manimaran
{"title":"Extremal Trees for the Geometric-Arithmetic Index with the Maximum Degree","authors":"A. Divya, A. Manimaran","doi":"10.47443/dml.2021.s207","DOIUrl":"https://doi.org/10.47443/dml.2021.s207","url":null,"abstract":"Abstract For a graph G, the geometric-arithmetic index of G, denoted by GA(G), is defined as the sum of the quantities 2 √ dx × dy/(dx + dy) over all edges xy ∈ E(G). Here, dx indicates the vertex degree of x. For every tree T of order n ≥ 3, Vukičević and Furtula [J. Math. Chem. 46 (2009) 1369–1376] demonstrated that GA(T ) ≤ 4 √ 2 3 + (n − 3). This result is extended in the present paper. Particularly, for any tree T of order n ≥ 5 and maximum degree ∆, it is proved that","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48493245","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
An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs 二分图Kirchhoff指数的一个改进下界
IF 0.8
Discrete Mathematics Letters Pub Date : 2022-01-18 DOI: 10.47443/dml.2021.0118
S. Altindag, I. Milovanovic, E. Milovanovic, M. Matejic
{"title":"An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs","authors":"S. Altindag, I. Milovanovic, E. Milovanovic, M. Matejic","doi":"10.47443/dml.2021.0118","DOIUrl":"https://doi.org/10.47443/dml.2021.0118","url":null,"abstract":"Abstract For a connected graphGwithn vertices andm edges, the degree Kirchhoff index ofG is defined asKf∗ (G) = 2m ∑n−1 i=1 (γi) , where γ1 ≥ γ2 ≥ · · · ≥ γn−1 > γn = 0 are the normalized Laplacian eigenvalues of G. In this paper, a lower bound on the degree Kirchhoff index of bipartite graphs is established. Also, it is proved that the obtained bound is stronger than a lower bound derived by Zhou and Trinajstić in [J. Math. Chem. 46 (2009) 283–289].","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46653300","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
Skew Dyck Paths With Catastrophes 带有突变的倾斜堤坝路径
IF 0.8
Discrete Mathematics Letters Pub Date : 2022-01-07 DOI: 10.47443/dml.2022.008
H. Prodinger
{"title":"Skew Dyck Paths With Catastrophes","authors":"H. Prodinger","doi":"10.47443/dml.2022.008","DOIUrl":"https://doi.org/10.47443/dml.2022.008","url":null,"abstract":"Skew Dyck paths are like Dyck paths, but an additional south-west step (−1,−1) is allowed, provided that the path does not intersect itself. Lattice paths with catastrophes can drop from any level to the origin in just one step. We combine these two ideas. The analysis is strictly based on generating functions, and the kernel method is used.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45895841","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
General Randić Index of Unicyclic Graphs With Given Number of Pendant Vertices 具有给定悬垂顶点数的单圈图的一般Randić指数
IF 0.8
Discrete Mathematics Letters Pub Date : 2022-01-04 DOI: 10.47443/dml.2021.0124
T. Vetrík, S. Balachandran
{"title":"General Randić Index of Unicyclic Graphs With Given Number of Pendant Vertices","authors":"T. Vetrík, S. Balachandran","doi":"10.47443/dml.2021.0124","DOIUrl":"https://doi.org/10.47443/dml.2021.0124","url":null,"abstract":"© 2022 the authors. This is an open access article under the CC BY (International 4.0) license (www.creativecommons.org/licenses/by/4.0/). Abstract For a ∈ R and a graph G, the general Randić index is defined as Ra(G) = ∑ uv∈E(G)[dG(u)dG(v)] , where E(G) is the edge set of G, and dG(u) and dG(v) are degrees of the vertices u and v in G, respectively. For −0.64 ≤ a < 0, we give lower bounds on the general Randić index for unicyclic graphs with given number of pendant vertices, and with given order and number of pendant vertices. The extremal graphs are presented as well. Lower bounds on the classical Randić index are corollaries of our bounds on the general Randić index.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43464034","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
A Result on the Strength of Graphs by Factorizations of Complete Graphs 完全图的分解关于图的强度的一个结果
IF 0.8
Discrete Mathematics Letters Pub Date : 2021-12-23 DOI: 10.47443/dml.2021.0096
Rikio Ichishima, F. Muntaner-Batle
{"title":"A Result on the Strength of Graphs by Factorizations of Complete Graphs","authors":"Rikio Ichishima, F. Muntaner-Batle","doi":"10.47443/dml.2021.0096","DOIUrl":"https://doi.org/10.47443/dml.2021.0096","url":null,"abstract":"A numbering f of a graph G of order n is a labeling that assigns distinct elements of the set {1, 2, . . . , n} to the vertices of G. The strength of G is defined by str (G) = min {strf (G) |f is a numbering of G} , where strf (G) = max {f (u) + f (v) |uv ∈ E (G)}. In this paper, we present some results obtained from factorizations of complete graphs. In particular, we show that for every k ∈ [1, n− 1], there exists a graph G of order n satisfying δ (G) = k and str (G) = n+ k, where δ (G) denotes the minimum degree of G.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41619877","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
When the Cartesian product of directed cycles is hyper-Hamiltonian 当有向循环的笛卡尔乘积是超哈密顿的
IF 0.8
Discrete Mathematics Letters Pub Date : 2021-12-13 DOI: 10.47443/dml.2021.0088
{"title":"When the Cartesian product of directed cycles is hyper-Hamiltonian","authors":"","doi":"10.47443/dml.2021.0088","DOIUrl":"https://doi.org/10.47443/dml.2021.0088","url":null,"abstract":"","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49049641","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
Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges 给定边数且直径为2的图的最小距离不平衡性
IF 0.8
Discrete Mathematics Letters Pub Date : 2021-11-16 DOI: 10.47443/dml.2021.s205
Kexiang Xu, Peiqi Yao
{"title":"Minimum Distance-Unbalancedness of Graphs With Diameter 2 and Given Number of Edges","authors":"Kexiang Xu, Peiqi Yao","doi":"10.47443/dml.2021.s205","DOIUrl":"https://doi.org/10.47443/dml.2021.s205","url":null,"abstract":"For a graph G, and for two distinct vertices u and v of G, let nG(u, v) be the number of vertices of G that are closer in G to u than to v. The distance-unbalancedness of G is the sum of |nG(u, v)− nG(v, u)| over all unordered pairs of distinct vertices u and v of G. We determine the minimum distance-unbalancedness of 2-self-centered graphs with given number of edges. We also determine the minimum distance-unbalancedness of graphs with at least one universal vertex and given number of edges.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2021-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42515027","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
首页 上一页 下一页 尾页
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学术官方微信