Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 134
Volume 134, July 2017
- Shang-wang Tan, Dong-Fang Wang:
Bicyclic graphs with the second up to seventh largest Wiener indices. Ars Comb. 134: 3-27 (2017) - P. Anusha Devi, S. Monikandan:
Degree Associated Reconstruction Number of Graphs with Regular Pruned Graph. Ars Comb. 134: 29-41 (2017) - Tao Wang, Deming Li:
A class of degree-magic join graphs. Ars Comb. 134: 43-50 (2017) - Guoliang Hao:
On the domination number of digraphs. Ars Comb. 134: 51-60 (2017) - Ali Azimi, Mohammad Farrokhi Derakhshandeh Ghouchan:
Cycles And Paths In Jacobson Graphs. Ars Comb. 134: 61-74 (2017) - Hong Lin, Lin Yu:
On edge contractible graphs. Ars Comb. 134: 75-79 (2017) - Zeling Shao, Xiaolei Hao, Zhiguo Li:
Genus embeddings of two types of graphs. Ars Comb. 134: 81-91 (2017) - A. Babai, Behrooz Khosravi:
Semisymmetric Cubic Graphs Of Order 10pn. Ars Comb. 134 (2017) - Elyssa Cipriano, Stephanie Costa, Rebecca Sparks:
Z-Cyclic Generalized Ordered Whist Tournaments. Ars Comb. 134: 99-109 (2017) - Weiling Sun, Tianmei Song, Ji-Ming Guo, Shang-wang Tan:
On the minimum spectral radius of trees with given matching number. Ars Comb. 134: 111-134 (2017) - María del Río Francos:
Truncation Symmetry Type Graphs. Ars Comb. 134: 135-167 (2017) - Xiaojuan Jiang, Guihua Huang, Meijun Kuang, Hanyuan Deng:
On R' index of a graph. Ars Comb. 134: 169-176 (2017) - Mohammed M. M. Jaradat, Mohammed S. A. Bataineh, N. Al Hazeem:
The theta-complete graph Ramsey number R(θn, K5) = 4n-3 for n=6 and n ³ 10. Ars Comb. 134: 177-191 (2017) - Marcin Krzywkowski:
Double outer-independent domination in graphs. Ars Comb. 134: 193-207 (2017) - Hongying Lin, Bo Zhou:
Distance spectral radius of quasi-trees. Ars Comb. 134: 209-213 (2017) - Saeid Alikhani, Emeric Deutsch:
More on domination polynomial and domination root. Ars Comb. 134: 215-232 (2017) - Fang Yang, Xiangen Chen, Chunyan Ma:
On the vertex-distinguishing proper total colorings of complete p-partite graphs with equipotent parts. Ars Comb. 134: 233-249 (2017) - De-Yin Zheng, Peipei Tang:
Two Kinds Of m-Stirling Numbers. Ars Comb. 134: 251-259 (2017) - Saieed Akbari, Babak Miraftab, Reza Nikandish:
A Note on Co-Maximal Ideal Graph of Commutative Rings. Ars Comb. 134: 261-265 (2017) - Liqiong Xu, Fuji Zhang:
On the incidence energy of graphs under three graph decorations. Ars Comb. 134: 267-281 (2017) - Mohsen Ghasemi, Rezvan Varmazyar:
A Family Of Tetravalent One-Regular Graphs. Ars Comb. 134: 283-293 (2017) - Fuqin Zhan, Youfu Qiao, Junliang Cai:
Bounds of the Sum-connectivity Energy of Graphs. Ars Comb. 134: 295-301 (2017) - David Slutzky:
Recursive Formulae for the Chromatic Polynomials of Complete r-uniform Mixed Interval Hypergraphs. Ars Comb. 134: 303-324 (2017) - Liancui Zuo, Shasha Ma, Shaoqiang Zhang:
Equitable coloring of Cartesian product of some graphs. Ars Comb. 134: 325-337 (2017) - Changiz Eslahchi, Hamid Reza Maimani, Rouzbeh Torabi, Ruzbeh Tusserkani:
Dynamical 2-domination in Graphs. Ars Comb. 134: 339-350 (2017) - Guanglong Yu, Shu-Guang Guo, Mingqing Zhai:
Distance spectral radius of a tree with given diameter. Ars Comb. 134: 351-362 (2017) - Zoran Z. Petrovic, Zoran S. Pucanovic:
The Clean Graph Of A Commutative Ring. Ars Comb. 134: 363-378 (2017) - Yong Zhang, Wen Li, Ruizhong Wei:
Yang Hui type magic squares with t-powered sum. Ars Comb. 134: 379-401 (2017) - Mojgan Afkhami, Masoud Karimi, Kazem Khashyarmanesh:
On The Planarity Of The Regular Digraph Of Ideals Of Commutative Rings. Ars Comb. 134: 403-423 (2017)
a service of 
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 2024-04-19 20:18 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
