Volume CI, July, 2011

Research Article

The hat problem on cycles on at least nine vertices

Krzywkowski, Marcin

Ars Comb. 101, 3-13 (2011).

Research Article

The sum numbers and the integral sum numbers of the graph Kn∖E(Cn−1)

Wang, Haiying; Ji, Yang; Li, Chuantao

Ars Comb. 101, 15-26 (2011).

Research Article

The existence of block-transitive 2-(q,8,1) designs with q a prime power

Gong, Luozhong; Liu, Weijun

Ars Comb. 101, 27-32 (2011).

Research Article

On chromatic number of graphs without certain induced subgraphs

Duan, Fang; Wu, Baoyindureng

Ars Comb. 101, 33-44 (2011).

Research Article

Connected M2-equicoverable graphs with circumference at most 5

Zhang, Yuqin; Zhang, Liandi

Ars Comb. 101, 45-63 (2011).

Research Article

On two bijections from Sn(321) to Sn(132)

Saracino, Dan

Ars Comb. 101, 65-74 (2011).

Research Article

Flexibility of circular graphs C(2n,2) on the projective plane

Yang, Yan; Liu, Yanpei

Ars Comb. 101, 75-84 (2011).

Research Article

Pebbling number of Bi-wheel: a diameter three class 0 graph

Kumar, M. S. Anil

Ars Comb. 101, 85-95 (2011).

Research Article

Super edge-antimagic total labelings of mKn,n,n

Dafik; Miller, Mirka; Ryan, Joe; Bača, Martin

Ars Comb. 101, 97-107 (2011).

Research Article

The γ-spectrum of a graph

da Fonseca, C. M.; Saenpholphat, Varaporn; Zhang, Ping

Ars Comb. 101, 109-127 (2011).

Research Article

A note on spanning Eulerian graphs

Li, Liangchen; Li, Xiangwen

Ars Comb. 101, 129-135 (2011).

Research Article

On the vertex geodomination number of a graph

Santhakumaran, A. P.; Titus, P.

Ars Comb. 101, 137-151 (2011).

Research Article

The properties of middle digraphs

Liu, Juan; Zhang, Xindong; Meng, Jixiang

Ars Comb. 101, 153-160 (2011).

Research Article

Extremal values for identification, domination and maximum cliques in twin-free graphs

Charon, Irène; Hudry, Olivier; Lobstein, Antoine

Ars Comb. 101, 161-185 (2011).

Research Article

Sums of products of binomial coefficients

Ismail, Mourad E. H.

Ars Comb. 101, 187-192 (2011).

Research Article

Supergraphs and graphical complexity of permutation groups

Kisielewicz, Andrzej

Ars Comb. 101, 193-207 (2011).

Research Article

Direct sum, direct product and lexicographic product of lattices

Li, Zengti

Ars Comb. 101, 209-215 (2011).

Research Article

(a,d)-edge-antimagic total labelings of cycle

Gao, Zhenbin

Ars Comb. 101, 217-223 (2011).

Research Article

Number of embeddings of wheel graphs on surfaces of small genus

Yang, Yan; Liu, Yanpei

Ars Comb. 101, 225-249 (2011).

Research Article

Domination in lexicographic product graphs

Zhang, Xindong; Liu, Juan; Meng, Jixiang

Ars Comb. 101, 251-256 (2011).

Research Article

Umbral calculus and invariant sequences

Fang, Qin; Wang, Tianming

Ars Comb. 101, 257-264 (2011).

Research Article

On the minimum diameter of plane integral point sets

Kurz, Sascha; Wassermann, Alfred

Ars Comb. 101, 265-287 (2011).

Research Article

A note on eigenvalues of the derangement graph

Deng, Yun-Ping; Zhang, Xiao-Dong

Ars Comb. 101, 289-299 (2011).

Research Article

Commutative weakly distance-regular digraphs of circle with fixed length

Li, Zengti; Gao, Suogang; Guo, Haixia

Ars Comb. 101, 301-307 (2011).

Research Article

Locating and liar domination of circulant networks

Manuel, Paul

Ars Comb. 101, 309-320 (2011).

Research Article

Minimal weak separators of chordal graphs

McKee, Terry A.

Ars Comb. 101, 321-331 (2011).

Research Article

List-colouring the square of an outerplanar graph

Hetherington, Timothy J.; Woodall, Douglas R.

Ars Comb. 101, 333-342 (2011).

Research Article

Two families of lattices

Li, Zengti; Deng, Fengru

Ars Comb. 101, 343-352 (2011).

Research Article

Extremal zeroth-order general Randić index of thorn graphs

Chen, Shubo; Liu, Weijun; Yan, Fengming

Ars Comb. 101, 353-358 (2011).

Research Article

On potentially K5−E3-graphic sequences

Hu, Lili; Lai, Chunhui

Ars Comb. 101, 359-383 (2011).

Research Article

Some α-graphs and odd graceful graphs

Seoud, M. A.; Helmi, E. F.

Ars Comb. 101, 385-404 (2011).

Research Article

On 2-domination and independence domination numbers of graphs

Hansberg, Adriana; Volkmann, Lutz

Ars Comb. 101, 405-415 (2011).

Research Article

Remarks on group rings and the Davenport constant

Gao, Weidong; Li, Yuanlin

Ars Comb. 101, 417-423 (2011).

Research Article

Quaternary quasi-cyclic codes with even length components

Siap, Irfan; Abualrub, Taher; Aydin, Nuh

Ars Comb. 101, 425-434 (2011).

Research Article

Isomorphisms of directed P⃗ 3-graphs

Li, Xueliang; Liu, Yan; Zhao, Biao

Ars Comb. 101, 435-438 (2011).

Research Article

Recurrence relations of the second order and infinite series identities

Chu, Wenchang; Wang, Xiaoxia

Ars Comb. 101, 449-457 (2011).

Research Article

The stopping distance of binary BCH-code parity-check matrices

Esmaeili, M.; Hooshmand, Z.

Ars Comb. 101, 459-466 (2011).

Research Article

The connected domination and tree domination of P(n,k) for k=1,2,⌊n/2⌋

Zhao, Chengye; Yang, Yuansheng; Sun, Linlin; Cao, Feilong

Ars Comb. 101, 467-479 (2011).

Research Article

On the diameter and inverse degree

Li, Xueliang; Shi, Yongtang

Ars Comb. 101, 481-487 (2011).

Research Article

Global domination and packing numbers

Dutton, Ronald D.

Ars Comb. 101, 489-501 (2011).

Research Article

On the Balaban index of trees

Li, Shuxian; Zhou, Bo

Ars Comb. 101, 503-512 (2011).

Research Article

Note on the rainbow k-connectivity of regular complete bipartite graphs

Li, Xueliang; Sun, Yuefang

Ars Comb. 101, 513-518 (2011).

Research Article

On product cordial graphs

Seoud, M. A.; Helmi, E. F.

Ars Comb. 101, 519-529 (2011).

E-mail Alert

Add your e-mail address to receive upcoming issues of Ars Combinatoria.

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;