default search action
Discrete Applied Mathematics, Volume 221
Volume 221, April 2017
- Paul Ruet:
Negative local feedbacks in Boolean networks. 1-17
- Bhaskar DasGupta, Nasim Mobasheri:
On optimal approximability results for computing the strong metric dimension. 18-24
- Robert E. L. Aldred, Michael D. Plummer:
Matching extension in prism graphs. 25-32 - Michael P. Allocca, Jason M. Graham, Candice R. Price, Shannon N. Talbott, Jennifer F. Vasquez:
Word length perturbations in certain symmetric presentations of dihedral groups. 33-45 - Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis:
Restricted optimal pebbling and domination in graphs. 46-53 - Emeric Deutsch, Sergi Elizalde:
Statistics on bargraphs viewed as cornerless Motzkin paths. 54-66 - Edin Glogic, Emir Zogic, Natasa Glisovic:
Remarks on the upper bound for the Randić energy of bipartite graphs. 67-70 - Chunling He, Shuchao Li, Mengtian Wang:
On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum. 71-81 - Weijun Liu, Qiang Guo, Yanbo Zhang, Lihua Feng, Ivan Gutman:
Further results on the largest matching root of unicyclic graphs. 82-88 - Phillip Mafuta, Simon Mukwembi:
On minimum degree, leaf number, traceability and Hamiltonicity in graphs. 89-94 - Duc Hiep Pham, Thang Pham, Le Anh Vinh:
An improvement on the number of simplices in. 95-105 - Zhendong Shao, Igor Averbakh, Roberto Solis-Oba:
L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. 106-114
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.