default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArs Combinatoria, Volume 98
Volume 98, January 2011
- Ahmad Mahmood Qureshi:
A New Version of Menages Problem. Ars Comb. 98: 3-6 (2011) - Shengxiang Lv, Yanpei Liu:
A new bound on maximum genus of simple graphs. Ars Comb. 98: 7-14 (2011) - Mingjing Gao, Erfang Shan:
The Signed Total Domination Number of Graphs. Ars Comb. 98: 15-24 (2011) - Jinhua Yang, Feng-Zhen Zhao:
Values of a Class of Generalized Euler and Bernoulli Numbers. Ars Comb. 98: 25-32 (2011) - A. P. Santhakumaran, S. Athisayanathan:
Weak Edge Detour Number of a Graph. Ars Comb. 98: 33-61 (2011) - Shuhua Li, Hong Bian, Guoping Wang, Haizheng Yu:
Vertex PI indices of some sums of graphs. Ars Comb. 98: 63-71 (2011) - Xiaoxin Song, Weiping Shang:
Roman domination in a tree. Ars Comb. 98: 73-82 (2011) - Weiping Wang, Tian-ming Wang:
Matrices related to the idempotent numbers and the numbers of planted forests. Ars Comb. 98: 83-96 (2011) - H. Cao, Y. Wu:
Simple Kirkman Packing Designs SKPD({3, 4}, v) with index two. Ars Comb. 98: 97-111 (2011) - Xudong Yuan, Tingting Li, Jianji Su:
The Vertices of Lower Degree in Contraction-Critical k-Connected Graphs. Ars Comb. 98: 113-127 (2011) - Emrah Kiliç, Nurettin Irmak:
Binomial Identities Involving The Generalized Fibonacci Type Polynomials. Ars Comb. 98: 129-134 (2011) - Suogang Gao, Jun Guo:
A construction of distance-regular graphs from subspaces in d-bounded distance-regular graphs. Ars Comb. 98: 135-148 (2011) - Yue Xi, Yuansheng Yang, Xin-hong Meng:
Skolem-Gracefulness of k-Stars. Ars Comb. 98: 149-160 (2011) - Ming-Ju Lee, Chiang Lin, Wei-Han Tsai:
On Antimagic Labeling For Power of Cycles. Ars Comb. 98: 161-165 (2011) - Hong Bian, Fuji Zhang, Guoping Wang, Haizheng Yu:
Extremal polygonal cactus chain concerning k-independent sets. Ars Comb. 98: 167-172 (2011) - Kenta Ozeki, Tomoki Yamashita:
Dominating cycles in triangle-free graphs. Ars Comb. 98: 173-182 (2011) - Jian-Liang Wu, Yu-Wen Wu:
Edge colorings of planar graphs with maximum degree five. Ars Comb. 98: 183-191 (2011) - Yunshu Gao, Jin Yan, Guojun Li:
On 2-Factors with Chorded Quadrilaterals in Graphs. Ars Comb. 98: 193-201 (2011) - Roslan Hasni, Y. H. Peng:
Chromatic Uniqueness of Complete Bipartite Graphs With Certain Edges Deleted. Ars Comb. 98: 203-213 (2011) - Iwona Wloch:
On kernels by monochromatic paths in D-join. Ars Comb. 98: 215-224 (2011) - René Schott, G. Stacey Staples:
Nilpotent Adjacency Matrices and Random Graphs. Ars Comb. 98: 225-239 (2011) - Xuechao Li:
A new lower bound on critical graphs with maximum degree of 8 and 9. Ars Comb. 98: 241-257 (2011) - Petros Hadjicostas, K. B. Lakshmanan:
Measures of disorder and straight insertion sort with erroneous comparisons. Ars Comb. 98: 259-288 (2011) - Rao Li:
Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth Numbers. Ars Comb. 98: 289-294 (2011) - Sibel Özkan:
Generalization of the Erdos-Gallai Inequality. Ars Comb. 98: 295-302 (2011) - Lihua Feng:
Spectral radius of graph with given diameter. Ars Comb. 98: 303-308 (2011) - Lihua Feng, Guihai Yu:
Erratum to: A note on the eigenvalues of graphs. Ars Comb. 98: 309 (2011) - Mingqing Zhai, Ruifang Liu, Jinlong Shu:
On the (Laplacian) spectral radius of bipartite graphs with given number of blocks. Ars Comb. 98: 311-319 (2011) - Bart De Bruyn:
The valuations of the near 2n-gon In. Ars Comb. 98: 321-336 (2011) - Renwang Su, Hung-Lin Fu:
Embeddings of Maximum Packings of Triples. Ars Comb. 98: 337-351 (2011) - Hortensia Galeana-Sánchez, Rocío Sánchez-López:
H-kernels in the D-join. Ars Comb. 98: 353-377 (2011) - R. S. Manikandan, P. Paulraja, S. Sivasankar:
Directed Hamilton cycle decompositions of the tensor product of symmetric digraphs. Ars Comb. 98: 379-386 (2011) - Hongyu Chen, Xuegang Chen, Xiang Tan:
On k-connected restrained domination in graphs. Ars Comb. 98: 387-397 (2011) - Selvam Avadayappan, P. Santhi:
Some results on neighbourhood highly irregular graphs. Ars Comb. 98: 399-414 (2011) - Yunshu Gao, Guojun Li:
On the Maximum Number of Disjoint Chorded Cycles in Graphs. Ars Comb. 98: 415-422 (2011) - Jianqin Zhou:
An algorithm to find k-tight optimal double-loop networks. Ars Comb. 98: 423-432 (2011) - Wenping Zheng, Xiaohui Lin, Yuansheng Yang, Xiwu Yang:
The Crossing Numbers of Cartesian Product of Cone Graph Cm + Kl with Path Pn. Ars Comb. 98: 433-335 (2011) - Takao Komatsu:
On the sum of reciprocal Tribonacci numbers. Ars Comb. 98: 447-459 (2011) - Xiangfeng Pan, Meijie Ma, Jun-Ming Xu:
Highly Fault-Tolerant Routings in Some Cartesian Product Digraphs. Ars Comb. 98: 461-470 (2011) - Lianying Miao:
On the Independence Number of Edge Chromatic Critical Graphs. Ars Comb. 98: 471-481 (2011) - Zhao Zhang, Fengxia Liu:
Isoperimetric Edge Connectivity of Line Graphs and Path Graphs. Ars Comb. 98: 483-491 (2011) - Maggy Tomova, Cindy Wyels:
Pebbling Graph Products. Ars Comb. 98: 493-499 (2011) - Paul D. Manuel, Indra Rajasingh:
Minimum Metric Dimension of Silicate Networks. Ars Comb. 98: 501-510 (2011) - Jianchu Zeng, Yanpei Liu:
Genus Distributions For Double Pearl-Ladder Graphs. Ars Comb. 98: 511-520 (2011) - Vito Abatangelo, Bambina Larato:
Complete Arcs In Moulton Planes Of Odd Order. Ars Comb. 98: 521-527 (2011)
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 2025-12-05 22:24 CET 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:
