Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 104
Volume 104, April 2012
- Qiong-yang Wu, Yan-bing Zhao, Yuan-ji Huo:
Lattice of all subsets of a finite set and partition lattice of a n-set. Ars Comb. 104: 3-11 (2012) - Lihua Feng, Aleksandar Ilic, Guihai Yu:
On the second maximal and minimal Wiener index of unicyclic graphs with given girth. Ars Comb. 104: 13-22 (2012) - Yuansheng Yang, Xueliang Fu, Baoqi Jiang:
On the Packing Number of Generalized Petersen Graphs P(n, 2). Ars Comb. 104: 23-32 (2012) - Damei Lu, Wensong Lin, Zengmin Song:
Distance two labelings of Cartesian products of complete graphs. Ars Comb. 104: 33-40 (2012) - B. Bhattacharjya, Arbind Kumar Lal:
On the Magic Space of Locally Finite Graphs. Ars Comb. 104: 41-64 (2012) - Shasha Li, Wei Li, Xueliang Li:
The generalized connectivity of complete bipartite graphs. Ars Comb. 104: 65-79 (2012) - Selda Küçükçifçi, Emine Sule Yazici, Charles Curtis Lindner:
The full metamorphosis of λ-fold block designs with block size four into λ-fold 4-cycle systems. Ars Comb. 104: 81-96 (2012) - Ming-Ju Lee:
On super (a, 1)-edge entimagic total labelings of grids and crowns. Ars Comb. 104: 97-105 (2012) - Vincent Ranwez, Stefan Janaqi, Sylvie Ranwez:
An O(n . m) algorithm for calculating the closure of lca-type operators. Ars Comb. 104: 107-128 (2012) - Zeling Shao, Yanpei Liu:
On the number of genus embeddings of complete tripartite graph Kn, n, l. Ars Comb. 104: 129-142 (2012) - A. Elumalai, G. Sethuraman:
Gracefulness Of A Cycle With Parallel Chords And Parallel Pk-Chords Of Different Lengths. Ars Comb. 104: 143-148 (2012) - Fatih Yilmaz, Durmus Bozkurt:
Some Properties of Padovan Sequence by Matrix Methods. Ars Comb. 104: 149-160 (2012) - Cheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu:
Super Spanning Connectivity of Augmented Cubes. Ars Comb. 104: 161-177 (2012) - Lutz Volkmann:
The smallest regular graphs which are not 1-extendable. Ars Comb. 104: 179-184 (2012) - Daili, Zhenghua Wang, Zheng Xie:
Gracefulness of P2r, 2m. Ars Comb. 104: 185-191 (2012) - Xiaolin Chen, Xueliang Li:
A solution to a conjecture on two rainbow connection numbers of a graph. Ars Comb. 104: 193-196 (2012) - Dianhua Wu, Qing Shu, Ryoh Fuji-Hara, Desheng Li, Shuming Chen:
The existence of doubly disjoint (mt+1, m, m-1) difference families. Ars Comb. 104: 197-209 (2012) - Rundan Xing, Bo Zhou, Ante Graovac:
On Sum-Balaban Index. Ars Comb. 104: 211-223 (2012) - Muhammad Hussain, Edy Tri Baskoro, Kashif Ali:
On super antimagic total labeling of Harary graph. Ars Comb. 104: 225-233 (2012) - Luozhong Gong, Weijun Liu:
Fourth order Randic index of phenylenes. Ars Comb. 104: 235-240 (2012) - M. A. Seoud, A. El Sonbaty, A. E. A. Mahran:
On Prime Graphs. Ars Comb. 104: 241-260 (2012) - Lingping Zhong:
The Harmonic Index on Unicyclic Graphs. Ars Comb. 104: 261-269 (2012) - Maged Z. Youssef:
On Ek-cordial labeling. Ars Comb. 104: 271-279 (2012) - Guoling Li, Qianhong Zhang:
A note on the Merrifield-Simmons index of connected graphs. Ars Comb. 104: 281-287 (2012) - Jinyan Wang, Jianming Zhan, Wenxiang Gu:
Some new results on soft hypermodules. Ars Comb. 104: 289-306 (2012) - Gek Ling Chia, Carsten Thomassen:
On the Number of Longest and Almost Longest Cycles in Cubic Graphs. Ars Comb. 104: 307-320 (2012) - Terry Eddy, M. M. Parmenter:
Groups With Restricted Squaring Properties. Ars Comb. 104: 321-331 (2012) - Masoud Ariannejad, M. Emami:
Notes on the Support of t-Designs. Ars Comb. 104: 333-339 (2012) - Hongtao Zhao, Feifei Fan:
Large sets of P3-decompostitions of complete multipartite graphs. Ars Comb. 104: 341-352 (2012) - Pentti Haukkanen, Jorma K. Merikoski:
Some formulas for numbers of line segments and lines in a rectangular grid. Ars Comb. 104: 353-361 (2012) - Jason I. Brown, Richard Hoshino:
On Circulants Uniquely Characterized by their Independence Polynomials. Ars Comb. 104: 363-374 (2012) - Gholam Hossein Fath-Tabar, Amir Loghman:
On Vertex Matching Polynomial of Graphs. Ars Comb. 104: 375-384 (2012) - Mingqing Zhai, Guanglong Yu, Jinlong Shu:
Clique number and distance spectral radii of graphs. Ars Comb. 104: 385-392 (2012) - Boris Horvat, Tomaz Pisanski:
Unit distance representations of the Petersen graph in the plane. Ars Comb. 104: 393-415 (2012) - M. H. Armanious:
On Steiner Quasigroups of Cardinality 21. Ars Comb. 104: 417-430 (2012) - Xin Zhang, Guizhen Liu:
On edge colorings of 1-planar graphs without chordal 5-cycles. Ars Comb. 104: 431-436 (2012) - Taekyun Kim, Cheon Seoung Ryoo, Heungsu Yi:
A Note On q-Bernoulli Numbers And q-Bernstein Polynomials. Ars Comb. 104: 437-447 (2012) - Jamshid Moori, Bernardo Gabriel Rodrigues:
Some ternary codes invariant under the group McL: 2. Ars Comb. 104: 449-462 (2012) - Robert Brier:
The variety generated by the class of K-perfect m-cycle systems. Ars Comb. 104: 463-479 (2012) - Jian-Hua Yin, Jiong-Sheng Li, Wen-Ya Li:
Potentially K1, 1, t-graphic sequences. Ars Comb. 104: 481-488 (2012) - Lihua Feng, Aleksandar Ilic:
The Laplacian spectral radius of graphs with given connectivity. Ars Comb. 104: 489-495 (2012) - Louis W. Kolitsch:
A Look at the Reciprocal of the Generating Function for p-Regular Partitions. Ars Comb. 104: 497-503 (2012) - Yasin Yazlik, Necati Taskara:
Spectral norm, Eigenvalues and Determinant of Circulant Matrix involving the Generalized k-Horadam numbers. Ars Comb. 104: 505-512 (2012) - M. Tariq Rahim, Ioan Tomescu:
Multi-level distance labelings for helm graphs. Ars Comb. 104: 513-523 (2012) - Juan Liu, Jixiang Meng, Xindong Zhang:
The Transformation Digraph D++-. Ars Comb. 104: 525-535 (2012)
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 19:20 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:
