• Home
  • Submit Paper
  • Check Paper Status
  • Download Certificate/Paper
  • FAQs
  • Contact Us
Email: ijraset@gmail.com
IJRASET Logo
Journal Statistics & Approval Details
Recent Published Paper
Our Author's Feedback
 •  ISRA Impact Factor 7.894       •  SJIF Impact Factor: 7.538       •  Hard Copy of Certificates to All Authors       •  DOI by Crossref for all Published Papers       •  Soft Copy of Certificates- Within 04 Hours       •  Authors helpline No: +91-8813907089(Whatsapp)       •  No Publication Fee for Paper Submission       •  Hard Copy of Certificates to all Authors       •  UGC Approved Journal: IJRASET- Click here to Check     
  • About Us
    • About Us
    • Aim & Scope
  • Editorial Board
  • Impact Factor
  • Call For Papers
    • Submit Paper Online
    • Current Issue
    • Special Issue
  • For Authors
    • Instructions for Authors
    • Submit Paper
    • Download Certificates
    • Check Paper Status
    • Paper Format
    • Copyright Form
    • Membership
    • Peer Review
  • Past Issue
    • Monthly Issue
    • Special Issue
  • Pay Fee
    • Indian Authors
    • International Authors
  • Topics
ISSN: 2321-9653
Estd : 2013
IJRASET - Logo
  • Home
  • About Us
    • About Us
    • Aim & Scope
  • Editorial Board
  • Impact Factor
  • Call For Papers
    • Submit Paper Online
    • Current Issue
    • Special Issue
  • For Authors
    • Instructions for Authors
    • Submit Paper
    • Download Certificates
    • Check Paper Status
    • Paper Format
    • Copyright Form
    • Membership
    • Peer Review
  • Past Issue
    • Monthly Issue
    • Special Issue
  • Pay Fee
    • Indian Authors
    • International Authors
  • Topics

Ijraset Journal For Research in Applied Science and Engineering Technology

  • Home / Ijraset
  • On This Page
  • Abstract
  • Introduction
  • References
  • Copyright

Making Graphs Solvable in Peg Solitaire

Authors: Saranya M, Naveen L

DOI Link: https://doi.org/10.22214/ijraset.2022.47618

Certificate: View Certificate

Abstract

Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. Since then peg solitaire has been considered on quite a few classes of graphs. Beeler and Gray introduced the natural idea of adding edges to make an unsolvable graph solvable. Recently, the graph invariant ms(G), which is the minimal number of additional edges needed to make G solvable, has been introduced and investigated on banana trees by the authors. In this article, we determine ms(G) for several families of unsolvable graphs. Furthermore, we provide some general results for this number of Hamiltonian graphs and graphs obtained via binary graph operations.

Introduction

References

[1] R. A. Beeler and A. D. Gray, Extremal results for peg solitaire on graphs, Bull. Inst. Combin. Appl. 77 (2016), 30–42. [2] R. A. Beeler, H. Green and R. T. Harper, Peg solitaire on caterpillars, Integers 17 (2017), G1. [3]R. A. Beeler and D. P. Hoilman, Peg solitaire on graphs,Discrete Math. 311 (20) (2011),2198–2202. [3] R. A. Beeler and D. P. Hoilman, Peg solitaire on the windmill and the double star graphs, Australas. J. Combin. 52 (2012), 127–134. [4] R. A. Beeler and T. K. Rodriguez, Fool’s solitaire on graphs, Involve 5 (4) (2012), 473–480. [5] G. I. Bell, Solving triangular peg solitaire, J. Integer Seq. 11 (2008), Article 08.4.8

Copyright

Copyright © 2022 Saranya M, Naveen L. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

ijraset47618

Download Paper

Paper Id : IJRASET47618

Publish Date : 2022-11-22

ISSN : 2321-9653

Publisher Name : IJRASET

DOI Link : Click Here