Leech index of a tree-Reference-Cited by-同舟云学术

Leech index of a tree

Published:2021-06-23 Issue: Volume: Page:1-11
ISSN:0972-0529
Container-title:Journal of Discrete Mathematical Sciences and Cryptography
language:en
Short-container-title:Journal of Discrete Mathematical Sciences and Cryptography

Author:

Varghese Seena¹,Lakshmanan Aparna²,Arumugam S.³⁴⁵⁶

Affiliation:

1. Department of Mathematics, Federal Institute of Science and Technology, Angamaly 683577, Kerala, India

2. Department of Mathematics, St. Xavier’s College for Women, Aluva 683101, Kerala, India

3. National Centre for Advanced Research in Discrete Mathematics, Kalasalingam Academy of Research and Education, Anand Nagar, Krishnankoil 626126, Tamil Nadu, India

4. Department of Mathematics, Amrita Vishwa Vidyapeetham, Coimbatore 641112, Tamil Nadu, India

5. Department of Computer Science, Ball State University, Muncie, IN 47306, U.S.A

6. Department of Computer Science, Liverpool Hope University, Liverpool, U.K

Publisher

Informa UK Limited

Subject

Applied Mathematics,Algebra and Number Theory,Analysis

Link

https://www.tandfonline.com/doi/pdf/10.1080/09720529.2020.1800217

Reference11 articles.

1. Construction of Halin graph with perfect k-ary tree and its independent domination number

2. G. Chartrand and L. Lesniak, Graphs and digraphs, CRC (2005).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Leech graphs;COMMUN COMB OPTIM;2024

2. On Leech labelings of graphs and some related concepts;Discrete Mathematics;2024-04

3. Leech labeling problem on tristar;AIP Conference Proceedings;2023