Vol. 12 No. 2 (2017)

Articles

• The Forcing Strong Metric Dimension of a Graph

  R Lenin, KM Kathiresan, Martin Baca

  • PDF

• Lower Bounds on the Distance Domination Number of a Graph

  Randy Ryan Davila, Caleb Fast, Michael Henning, Franklin Kenter

  • PDF

• The Outercoarseness of the n-cube

  Alex Fink, Richard K Guy

  • PDF

• On combinatorial extensions of Rogers-Ramanujan type identities

  Megha Goyal

  • PDF

• On the total signed domination number of the Cartesian product of paths

  Hong Gao, Huiping Cao, Yuansheng Yang

  • PDF

• Shellability, vertex decomposability, and lexicographical products of graphs

  Kevin N Vander Meulen, Adam Van Tuyl

  • PDF

• On Chromatic Number of General Kneser Graphs

  Sharareh Alipour, Amir Jafari

  • PDF

• Degree Associated Reconstruction Parameters of Total Graphs

  P. Anusha Devi, S. Monikandan

  • PDF

• Bounds for the $m$-Eternal Domination Number of a Graph

  Michael Henning, William Klostermeyer, Gary MacGillivray

  • PDF

• On the metric dimension of circulant graphs with $4$ generators

  Tomas Vetrik

  • PDF

• Split (n + t)-color partitions and 2-color F-partitions

  Meenakshi Rana, J. K. Sareen

  • PDF

• Ball hulls, ball intersections, and 2-center problems for gauges

  Pedro Martin, Horst Martini, Margarita Spirova

  • PDF

• Group Irregular Labelings of Disconnected Graphs

  Marcin Anholcer, Sylwia Cichacz-Przenioslo

  • PDF

• On Cops and Robbers on $G^{\Xi}$ and cop-edge critical graphs.

  Domingos Moreira Cardoso, Charles Dominic, Łukasz Witkowski, Marcin Witkowski

  • PDF

• Internal and external duality in abstract polytopes

  Gabe Cunningham, Mark Mixer

  • PDF

• Permutations avoiding connected graphs

  Norbert Sauer, Imed Zaguia

  • PDF