Hamiltonian Laceability in Ring Product and Cyclo Product of Graphs

Girisha, A

doi:10.9734/bjmcs/2014/5861

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Leena Shenoy [8] studied hamiltonian laceability properties in product graphs involving cycles and paths. More results in the laceability properties of product graphs can be found in [5], [6] and [4]. Definition 1.1.…”

Section: Introductionmentioning

confidence: 99%

Hamiltonian laceability in the shadow distance graph of path graphs

Murali¹

2019

Malaya J. Mat.

View full text Add to dashboard Cite

A connected graph G is termed hamiltonian-t-laceable (t*-laceable) if there exists in it a hamiltonian path between every pair (at least one pair) of distinct vertices u and v with the property d(u, v) = t, 1 ≤ t ≤ diam(G), where t is a positive integer. In this paper, we establish laceability properties in the edge tolerant shadow distance graph of the path graph P n with distance set D s = {1, 2k}.

show abstract

Section: Introductionmentioning

confidence: 99%

Hamiltonian laceability in the shadow distance graph of path graphs

Murali¹

2019

Malaya J. Mat.

View full text Add to dashboard Cite

show abstract

Hamiltonian Laceability in Ring Product and Cyclo Product of Graphs

Cited by 1 publication

References 1 publication

Hamiltonian laceability in the shadow distance graph of path graphs

Hamiltonian laceability in the shadow distance graph of path graphs

Contact Info

Product

Resources

About