default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 141
Volume 141, October 2018
- Rong Zhang, Shu-Guang Guo, Guanglong Yu:
Ordering connected non-bipartite graphs by the least Q-eigenvalue. Ars Comb. 141: 3-20 (2018) - Junqing Cai:
Dominating set and hamiltonicity in claw-heavy graphs. Ars Comb. 141: 21-27 (2018) - Meera Mainkar, Matthew Plante, Ben Salisbury:
Counting Anosov Graphs. Ars Comb. 141: 29-51 (2018) - Huicai Jia, Ruifang Liu, Xue Du:
Wiener index and Harary index on Hamilton-connected and traceable graphs. Ars Comb. 141: 53-62 (2018) - Jingjing Huo, Wai Chee Shiu, Weifan Wang:
The neighbor expanded sum distinguishing index of Halin graphs. Ars Comb. 141: 63-73 (2018) - Assia Fettouma Tebtoub:
Log-concavity of principal diagonal rays in the regular Lah triangles. Ars Comb. 141: 75-83 (2018) - Renying Chang, Yan Zhu:
The linear programming approach to the harmonic index of a graph with minimum degree at least three. Ars Comb. 141: 85-92 (2018) - Ibrahim Tarawneh, Roslan Hasni, Muhammad Ahsan Asim:
On the edge irregularity strength of disjoint union of star graph and subdivision of star graph. Ars Comb. 141: 93-100 (2018) - Zongpeng Ding, Yuanqiu Huang, Zhangdong Ouyang:
The crossing numbers of Cartesian products of path with some graphs. Ars Comb. 141: 101-110 (2018) - Lang Tang, Shenglin Zhou, Xiaomin Zhu:
Further results on Wiener, Harary indices and graph properties. Ars Comb. 141: 111-123 (2018) - Farzaneh Ramezani, Mehdi Tale Masouleh:
Matching in Toeplitz graphs. Ars Comb. 141: 125-138 (2018) - Jianzhang Wu, Xiao Yu, Wei Gao:
An Extension Result on Fractional ID-(g, f, m)-Deleted Graph. Ars Comb. 141: 139-148 (2018) - R. Lakshmi, S. Vidhyapriya:
Kernels in tensor product of digraphs I. Ars Comb. 141: 149-156 (2018) - Ryo Nomura, Shoichi Tsuchiya:
Plane graphs without homeomorphically irreducible spanning trees. Ars Comb. 141: 157-165 (2018) - Haiyan Li, Jianhua Yin, Jin Guo:
A degree sequence variant of balanced bipartition problem of graphs. Ars Comb. 141: 167-178 (2018) - Bechir Chaari, Jamel Dammak:
An application of the incidence matrix to digraphs. Ars Comb. 141: 179-190 (2018) - Yuehua Bu, Chao Wang, Sheng Yang:
List injective Coloring of Planar Graphs. Ars Comb. 141: 191-211 (2018) - Akbar Ali, Akhlaq Ahmad Bhatti:
Extremal Triangular Chain Graphs For Bond Incident Degree (BID) Indices. Ars Comb. 141: 213-227 (2018) - Dinesh G. Sarvate, Mary Nanfuka:
Group divisible designs with block size 4 and number of groups 2 or 3. Ars Comb. 141: 229-241 (2018) - Bumtle Kang, Suh-Ryung Kim, Boram Park:
On safe sets of the Cartesian product of two complete graphs. Ars Comb. 141: 243-257 (2018) - Qing-Hua He, Shou-Jun Xu:
Hosoya polynomials of random phenylene chains. Ars Comb. 141: 259-268 (2018) - Vladimir Kolmogorov, Michal Rolínek:
Superconcentrators of Density 25.3. Ars Comb. 141: 269-304 (2018) - Fenglei Tian, Xinlei Wang, Dein Wong:
Distance spectrum of the generalized lexicographic product of a graph with a family of regular graphs. Ars Comb. 141: 305-311 (2018) - Saeed Shaebani:
A Note on Color Chains of Graphs. Ars Comb. 141: 313-317 (2018) - Jing Zhang, Xiaomiao Wang, Tao Wang:
Tricyclic balanced sampling plans avoiding adjacent units with block size three. Ars Comb. 141: 319-332 (2018) - G. Sharmiladevi, V. Kaladev:
On Co-PI Index of Graphs. Ars Comb. 141: 333-343 (2018) - Yaping Wu, Huiqing Liu, Qiong Fan:
On the spectral moments of signless Laplacian matrix of trees and unicyclic graphs. Ars Comb. 141: 345-351 (2018) - A. Ahmad, N. Akhtar, Wajeb Gharibi, A. Ashraf:
Computing total edge product cordial labeling of circulant graphs. Ars Comb. 141: 353-367 (2018) - Zuojuan Luo, Bo Zhou:
Nodal domain count and vertex bipartiteness. Ars Comb. 141: 369-374 (2018) - Gabriela Araujo-Pardo, Christian Rubio-Montiel:
On wy-Perfect Graphs. Ars Comb. 141: 375-387 (2018) - Jia Zhang, Yanfeng Luo:
End-regular generalized lexicographic products of bipartite graphs. Ars Comb. 141: 389-407 (2018)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-28 23:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
