Volume 56 (2024)
Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
4-TOTAL MEAN CORDIAL LABELING OF SOME TREES

R Ponraj; S SUBBULAKSHMI

Volume 56, Issue 1 , August 2024, , Pages 44-54

https://doi.org/10.22059/jac.2024.360730.1200

Abstract
  Let G be a graph. Let f : V (G) → {0, 1, 2,... ,k − 1}be a function where k ∈ N and k > 1. For each edge uv, assign thelabel f (uv) = lf(u)+f(v)2m. f is called a k-total mean cordial labeling of G if |tmf (i) − tmf (j)| ≤ 1, for all i,j ∈ {0, 1, 2,... ,k − 1},where ...  Read More

Inverse eigenvalue problem for matrices whose graph is a banana tree

Maryam Babaei Zarch; Seyed Abolfazl Shahzadeh Fazeli; Seyed Mehdi Karbassi

Volume 50, issue 2 , December 2018, , Pages 89-101

https://doi.org/10.22059/jac.2018.69994

Abstract
  In this  paper, we consider an  inverse eigenvalue problem (IEP) for constructing  a special  kind of acyclic matrices. The problem involves the reconstruction of matrices whose graph is a  banana tree. This is performed by using the  minimal and maximal eigenvalues of all  ...  Read More