Bharati Rajan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bharati Rajan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Cyriac Grigorious
Department of Mathematics, Loyola College, Chennai, India
1 shared publication Indra Rajasingh
Department of Mathematics, Loyola College, Chennai 600 034, India
1 shared publication- Micheal Arockiaraj
Department of Mathematics, Loyola College, Chennai, India
1 shared publication Mirka Miller
School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, NSW 2308, Australia
1 shared publication- Paul Manuel
Department of Information Science, College of Life Sciences, Kuwait University, Al-Shadadiya, Kuwait
1 shared publication - Sathish Krishnan
Department of Mathematics and Statistics, College of Science and Humanities, SRM Institute of Science and Technology, Kattankulathur, Kancheepuram 603 203, India
1 shared publication
Latest Publications
- 6 July 2022
- Published by Taylor & Francis in Polycyclic Aromatic Compounds
- Vol. 43 (5) , 4803-4815
Molecular Descriptor Analysis of Polyphenylene Superhoneycomb Networks
Molecular descriptors are widely employed to present molecular characteristics in cheminformatics. In QSAR/QSPR study, molecular descriptors are utilized to predict the bioactivity of chemical compounds. The polyphenylene network, known as porous graphene, is one of the most important and widely studied two-dimensional materials. In this paper we compute exact analytical expressions for certain distance based topological indices for polyphenylene superhoneycomb networks.
- 6 July 2022
- Published by Taylor & Francis in Polycyclic Aromatic Compounds
- Vol. 43 (5) , 4803-4815
Molecular Descriptor Analysis of Polyphenylene Superhoneycomb Networks
Molecular descriptors are widely employed to present molecular characteristics in cheminformatics. In QSAR/QSPR study, molecular descriptors are utilized to predict the bioactivity of chemical compounds. The polyphenylene network, known as porous graphene, is one of the most important and widely studied two-dimensional materials. In this paper we compute exact analytical expressions for certain distance based topological indices for polyphenylene superhoneycomb networks.
- Open Access
- 20 October 2016
- Published by Oxford University Press (OUP) in The Computer Journal
On the Partition Dimension of Circulant Graphs
For a vertex v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{d(v,x):x∈S}d(v,S)=min{d(v,x):x∈S} . For an ordered k-partition Π={S1,S2,…,Sk}Π={S1,S2,…,Sk} of V, the representation of v with respect to Π is the k-vector r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk))r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk)) . The k-partition Π is a resolving partition if the k-vectors r(v∣Π)r(v∣Π) , v∈Vv∈V are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. In this paper, we obtain the partition dimension of circulant graphs G=C(n,±{1,2,…,j}),1<j<⌊n2⌋G=C(n,±{1,2,…,j}),1n≥(j+k)(j+1)n≥(j+k)(j+1) and n≡k(mod2j)n≡k(mod2j) as, pd(G)=j+1{whenjisevenandgcd(k,2j)=1,whenjisoddandk=2m,1≤m≤j.pd(G)=j+1{whenjisevenandgcd(k,2j)=1,whenjisoddandk=2m,1≤m≤j.
- 20 October 2016
- Published by Oxford University Press (OUP) in The Computer Journal
Open AccessOn the Partition Dimension of Circulant Graphs
For a vertex v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{d(v,x):x∈S}d(v,S)=min{d(v,x):x∈S} . For an ordered k-partition Π={S1,S2,…,Sk}Π={S1,S2,…,Sk} of V, the representation of v with respect to Π is the k-vector r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk))r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk)) . The k-partition Π is a resolving partition if the k-vectors r(v∣Π)r(v∣Π) , v∈Vv∈V are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. In this paper, we obtain the partition dimension of circulant graphs G=C(n,±{1,2,…,j}),1<j<⌊n2⌋G=C(n,±{1,2,…,j}),1n≥(j+k)(j+1)n≥(j+k)(j+1) and n≡k(mod2j)n≡k(mod2j) as, pd(G)=j+1{whenjisevenandgcd(k,2j)=1,whenjisoddandk=2m,1≤m≤j.pd(G)=j+1{whenjisevenandgcd(k,2j)=1,whenjisoddandk=2m,1≤m≤j.
- 2 September 2011
- Published by Elsevier in Information Processing Letters
- Vol. 111 (18) , 921-925
Wirelength of 1-fault hamiltonian graphs into wheels and fans
- 2 September 2011
- Published by Elsevier in Information Processing Letters
- Vol. 111 (18) , 921-925
Wirelength of 1-fault hamiltonian graphs into wheels and fans