[1] Beineke, L.W. and Wilson, B.J. (1978), Selected Topics in Graph Theory, Academic Press Inc., London.
[2] Farzan, A. and Ian Munro, J. (2013), Succident encoding of arbitrary graphs, Theoretical Computer Science, 513, 38-52.
[3] Fish, W., Key, J.D., and Mwambene, E. (2010), Binary codes from the line graph of the n-cube, Journal of Symbolic Computation, 45, 800-812.
[4] Foucaud, F., Gravier, J., Naserasr, R., Parreau, A. and Valecov, P. (2013), Identifying codes in line graphs, Journal of Graph Theory, 73(4), 425-448.
[6] Grady, A. and Poznanovic, S. (2018), Graphical Mahonian statistics on words. The electronic journal of combinatorics, 25(1), #P1.1.
[7] Jukna, S. (2001), Extermal combinatorics with applications in computer science, Texts in theoretical computer science, Springer.
[8] Kitaev, S., Lozin, V. (2015), Words and Graphs, Springer Cham Heidelberg New York.
[9] Leibniz, G. (1703), Explication de l’Arithmétique Binaire (Explanation of Binary Arithmetic). Mathematical Writings VII, Gerhardt, 223.
[10] Millo, J. -V. and Simone, R. de (2012), Periodic scheduling of marked graphs using balanced binary words, Theoretical Computer Science, 458, 113-130.
[11] Rawlings, D. (1981), The r-major index, J. Combin. Theory Ser. A, 31(2), 175-183.
[12] West,D.B. (2001), Introductionto to Graph Theory, 2^{nd} ed., Prentice Hall, Upper Saddle River.