default search action
Ars Combinatoria, Volume 137
Volume 137, January 2018
- Ping Li, Keke Wang, Mingquan Zhan, Hong-Jian Lai:
Strongly Spanning Trailable Graphs with Short Longest Paths. Ars Comb. 137: 3-39 (2018) - Saad Ihsan Butt, Muhammad Numan, Inayat Ali Shah, Sartaj Ali:
Face labelings of type (1, 1, 1) for generalized prism. Ars Comb. 137: 41-52 (2018) - Junliang Cai:
Counting Rooted Non-separable Nearly Cubic Planar Maps. Ars Comb. 137: 53-70 (2018) - Jamel Dammak, Rahma Salem:
Hereditary hemimorphy of {5, -4}-hemimorphic arc connected digraphs. Ars Comb. 137: 71-94 (2018) - Liandi Zhang, Yuqin Zhang:
Pm ∪ Pk-equicoverable paths and cycles. Ars Comb. 137: 95-101 (2018) - Robson da Silva:
New Identities from a Combinatorial Approach to Generalized Fibonacci and Generalized Lucas Numbers. Ars Comb. 137: 103-111 (2018) - K. Selvakumar:
A Note On The Annihilating-Ideal Graph Of Commutative Rings. Ars Comb. 137: 113-122 (2018) - Esref Gurel, Mustafa Asci:
Some Properties Of Bivariate Gaussian Fibonacci And Lucas p-Polynomials. Ars Comb. 137: 123-139 (2018) - Zhangdong Ouyang, Jing Wang, Yuanqiu Huang:
The Strong Product of Graphs and Crossing Numbers. Ars Comb. 137: 141-147 (2018) - Mohammad Reza Oboudi:
On the largest real root of independence polynomials of trees. Ars Comb. 137: 149-164 (2018) - Zhendong Shao, Igor Averbakh:
The L(j, k)-Edge-Labeling Problem on Graphs. Ars Comb. 137: 165-176 (2018) - Polona Repolusk, Janez Zerovnik:
Formulas for various domination numbers of products of paths and cycles. Ars Comb. 137: 177-202 (2018) - Daniel Johnston, Chira Lumduanhom, Ping Zhang:
On k-Ramsey Numbers of Unicyclic-Star Graphs. Ars Comb. 137: 203-220 (2018) - Fenglei Tian, Li Chen, Rui Chu:
Rank of the Hermitian-adjacency matrix of a mixed graph in terms of matching number. Ars Comb. 137: 221-232 (2018) - Mehdi Azadi motlagh, Farokhlagha Moazami:
A Generalization of (2, w;d)-Cover Free Families. Ars Comb. 137: 233-248 (2018) - Jia-Bao Liu, Xiang-Feng Pan, Shicai Gong:
The characteristic polynomial of a graph operation and its applications. Ars Comb. 137: 249-255 (2018) - Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy:
A Note on Harmonic Index and Coloring Number of a Graph. Ars Comb. 137: 257-262 (2018) - Ali Ahmad:
Computing 3-total edge product cordial labeling of generalized Petersen graphs P(n, m). Ars Comb. 137: 263-271 (2018) - Chin-Mei Fu, Yu-Fong Hsu, Ming-Feng Li:
New Results on Graceful Unicyclic Graphs. Ars Comb. 137: 273-282 (2018) - Rommel M. Barbosa, Márcia R. Cappelle, Erika M. M. Coelho:
Maximal independent sets in complementary prism graphs. Ars Comb. 137: 283-294 (2018) - Bing He:
Some congruences involving q-harmonic numbers. Ars Comb. 137: 295-304 (2018) - Jian-Bo Lv:
On the harmonic index of quasi-tree graphs. Ars Comb. 137: 305-315 (2018) - Flavia Bonomo, Guillermo Durán, Ivo Koch, Mario Valencia-Pabon:
On the (k, i)-coloring of cacti and complete graphs. Ars Comb. 137: 317-333 (2018) - Yaping Wu, Qiong Fan, Shuai Yuan:
On the Spectral Moment of Quasi-trees and Quasi-unicyclic Graphs. Ars Comb. 137: 335-344 (2018) - Peter Adams, Saad I. El-Zanati, Wannasiri Wannasit:
The Spectrum Problem for the Cubic Graphs of Order 8. Ars Comb. 137: 345-354 (2018) - Liancui Zuo, Chunhong Shang, Shaoqiang Zhang, Shengjie He:
The linear t-arboricity of complete bipartite graphs. Ars Comb. 137: 355-364 (2018) - Yanjun Meng, Yanbo Zhang, Yunqing Zhang:
The Ramsey Number of Wheels versus a Fan of Order Five. Ars Comb. 137: 365-372 (2018) - S. Ramachandran, P. Bhanumathy:
Digraph Isomorpshism Using Subdigraph Equivalent Vertices And Degree Pair Association. Ars Comb. 137: 373-394 (2018) - Bo Deng, An Chang:
The higher Balaban index on weighted matrix. Ars Comb. 137: 395-402 (2018) - Wei Jin, Jicheng Ma:
Finite 2-Geodesic-Transitive Cayley Graphs Of Dihedral Groups. Ars Comb. 137: 403-417 (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.