Kitaev S, Pyatkin A (2008) On representable graphs. Autom Lang Combin 13(1):45–54

MathSciNet  MATH  Google Scholar 

Kitaev S, Pyatkin A (2018) Word-representable graphs: a survey. J Appl Ind Math 12(2):278–296

Article  MathSciNet  MATH  Google Scholar 

Gao Y, Lu H, Seki S, Yu S (2010) Proceedings of the 14th international conference, DLT 2010. Springer, London, ON, Canada

Kitaev S, Salimov P, Severs C, Ulfarsson H (2011) Word representability of line graphs. Open J Discrete Math 1(2):96–101

Article  MathSciNet  MATH  Google Scholar 

Kitaev S, Lozin V (2015) Words and graphs. Springer

Faal HT (2022) On lyndon-word representable graphs. arXiv preprint arXiv:2205.13752

Aslam A, Guirao JLG, Ahmad S, Gao W (2017) Topological indices of the line graph of subdivision graph of complete bipartite graphs. Appl Math Inf Sci 11:1631–1636. https://doi.org/10.18576/amis/110610

Article  MathSciNet  MATH  Google Scholar 

Gao W, Iqbal Z, Ishaq M, Sarfraz R, Aamir M, Aslam A (2018) On eccentricity based topological indices study of class of porphyrin-cored dendrimers. Biomolecules 8

Gao W, Iqbal Z, Ishaq M, Aslam A, Sarfraz R (2019) Topological aspects of dendrimers via distance-based descriptors. IEEE Access 7:35619–35630

Article  MATH  Google Scholar 

Kang SM, Iqbal Z, Ishaq M, Sarfraz R, Aslam A, Nazeer W (2018) On eccentricity-based topological indices and polynomials of phosphorus-containing dendrimers. Symmetry. https://doi.org/10.3390/sym10070237

Article  MATH  Google Scholar 

Diudea M (2018) Basic chemical graph theory, in multi-shell polyhedral clusters. Chemistry and Physics. Springer, Berlin, Germany, Carbon Materials

Sethukkarasi A, Vidyanandini S (2024) Graph composite labeling techniques and practical applications. In: 2024 international conference on emerging systems and intelligent computing (ESIC), Bhubaneswar, India, pp 526–532. https://doi.org/10.1109/ESIC60604.2024.10481632

Sethukkarasi A, Vidyanandini S, Nayak SR (2024) Local antimagic vertex coloring of a mycielski of graphs. J Discrete Math Sci Cryptogr 27(4):1389–1401. https://doi.org/10.47974/JDMSC-1993

Article  Google Scholar 

Bongale AM, Nirmala CR, Bongale AM (2022) Energy efficient intra-cluster data aggregation technique for wireless sensor network. Int J Inf Technol 14:827–835. https://doi.org/10.1007/s41870-020-00419-7

Article  Google Scholar 

Nerurkar P, Chandane M, Bhirud S (2022) Empirical analysis of synthetic and real networks. Int J Inf Technol 14:1061–1073. https://doi.org/10.1007/s41870-019-00344-4

Article  MATH  Google Scholar 

Nerurkar P, Chandane M, Bhirud S (2022) Understanding structure and behavior of systems: a network perspective. Int J Inf Technol 14:1145–1159. https://doi.org/10.1007/s41870-019-00354-2

Article  MATH  Google Scholar 

Koshti R, Singh M, Mandloi MEA (2023) Improvement in spectrum sensing of wireless regional area network with empirical mode decomposition. Int J Inf Technol 15:79–86. https://doi.org/10.1007/s41870-022-01122-5

Article  Google Scholar 

Jisha TE, Monoth T (2023) Contrast-enhanced visual cryptography schemes based on block pixel patterns. Int J Inf Technol 15:2445–2455. https://doi.org/10.1007/s41870-023-01286-8

Article  MATH  Google Scholar 

Kumaran P, Sridhar R, Muthuperumal S (2023) Ftltm: fine tuned linear threshold model for gauging of influential user in complex networks for information diffusion. Int J Inf Technol 15:3593–3604. https://doi.org/10.1007/s41870-023-01387-4

Article  MATH  Google Scholar 

Gutman I, Polansky OE (1986) Mathematical concepts in organic chemistry. Springer, Berlin, Germany

Kang SM, Iqbal Z, Ishaq M, Sarfraz R, Aslam A, Nazeer W (2018) On eccentricity-based topological indices and polynomials of phosphorus-containing dendrimers. vol 10. Berlin, Germany

Omas N, Mathew L, Sriram S, Subramanian KG (2021) Wiener-type indices of Parikh word representable graphs. Ars Mathematica Contemporanea 6. Accepted for publication

Thomas N, Mathew L, Sriram S, Nagar AK, Subramanian KG (2021) Certain distance-based topological indices of Parikh word representable graphs. J Math. https://doi.org/10.1155/2021/5567663

Article  MathSciNet  MATH  Google Scholar 

Atanasiu A (2007) Binary amiable words. Int J Found Comput Sci 18(2):387–400

Article  MathSciNet  MATH  Google Scholar 

Bera S, Mahalingam K, Subramanian KG (2009) Properties of Parikh matrices of binary words obtained by an extension of a restricted shuffle operator. Int J Found Comput Sci 29:403–414

Article  MathSciNet  MATH  Google Scholar 

Bonizzoni P, De Felice C, Zaccagnino R, Zizza R (2018) Inverse Lyndon words and inverse Lyndon factorizations of words. Adv Appl Math 101:281–319

Article  MathSciNet  MATH  Google Scholar 

Kasa Z (2011) On scattered subword complexity. Acta Univ. Sapientiae, Informatica 3(1):127–136. arXiv:1104.4425v1

Lothaire M (1983) Combinatorics on words. Addison-Wesley

Wiener H (1947) Structural determination of paraffin boiling points. J Am Chem Soc 69:17–20

Article  MATH  Google Scholar 

Gutman I, Trinajstic N (1972) Graph theory and molecular orbitals total \(\pi\)-electron energy of alternant hydrocarbons. Chem Phys Lett 17:535–538

Article  MATH  Google Scholar 

Fajtlowicz S (1987) On conjectures of graffiti-ii. Congr Numer 60:187–197

MathSciNet  MATH  Google Scholar 

Randic M (1975) Characterization of molecular branching. J Am Chem Soc 97:6609–6615. https://doi.org/10.1021/ja00856a001

Article  MATH  Google Scholar 

Gutman I, Furtula B, Elphick C (2014) Three new/old vertex-degree-based topological indices. MATCH Commun Math Comput Chem 72(3):617–632

MathSciNet  MATH  Google Scholar 

West DB (2000) Introduction to Graph Theory, 2nd edn

Bondy JA, Murty USR (1982) Graph theory with applications. Elsevier Science, New York, NY, USA

Mateescu A, Salomaa A, Salomaa K, Yu S (2001) A sharpening of the Parikh mapping. RAIRO-Theor Inf Appl 35(6):551–564

Article  MathSciNet  MATH  Google Scholar