Range of ring charts with a focus on material design
DOI:
https://doi.org/10.61117/ipsumtec.v6i5.228Keywords:
Energy graphs, Molecular graphs, Adjacency matrixAbstract
In this work we study the rank of the adjacency matrix of ring graphs, since many molecules have this configuration as a molecular graph. With this invariant we can study the characteristic polynomial and the energy of the graph, in order to have a mathematical tool for the study and development of sustainable materials and use them in energy generation.
Downloads
Metrics
References
S. Akbari, P. J. Cameron, G. B. Khosrovshahi. Ranks and signatures of adjacency matrices.
L. Wang and D. Wong (2014). Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank. Discrete Appl. Math. 166, páginas 276-281. DOI: https://doi.org/10.1016/j.dam.2013.09.012
A. Kotlov (1997). Rank and chromatic number of a graph. J. Graph Theory 26, páginas 1–8. DOI: https://doi.org/10.1002/(SICI)1097-0118(199709)26:1<1::AID-JGT1>3.3.CO;2-U
C.D. Godsil and G.F. Royle (2001). Chromatic number and the 2-rank of a graph. J. Combin. Theory Ser. B 81, páginas 142–149. DOI: https://doi.org/10.1006/jctb.2000.2003
A. Kotlov, L. Lovász (1996). The rank and size of graphs. J. Graph Theory 23(2), páginas 185–189. DOI: https://doi.org/10.1002/(SICI)1097-0118(199610)23:2<185::AID-JGT9>3.3.CO;2-X
W. H. Haemers, M. J. P. Peeters (2012). Designs, Codes and Cryptography. The maximum order of adjacency matrices of graphs with a given rank. Volume 65, páginas 223–232. DOI: https://doi.org/10.1007/s10623-011-9548-3
I. Sciriha (1999). On the rank of graphs, in: Y. Alavi, D.R. Lick, A. Schwenk (Eds.), Combinatorics, Graph Theory, and Algorithms, vol. II, New Issue Press, Western Michigan University, Kalamazoo, Michigan, páginas 769–778.
B. Cheng and B.L. Liu (2007). On the nullity of graphs. Electron. J. Linear Algebra. 16, páginas 60–67. DOI: https://doi.org/10.13001/1081-3810.1182
G.J. Chang, L.-H. Huang and H.-G. Yeh (2012). A characterization of graphs with rank 5. Linear Algebra Appl., 436, páginas 4241-4250. DOI: https://doi.org/10.1016/j.laa.2012.01.021
G.J. Chang, L.-H. Huang and H.-G. Yeh (2011). A characterization of graphs with rank 4. Linear Algebra Appl., 434, páginas 1793–1798. DOI: https://doi.org/10.1016/j.laa.2010.09.040
I. Gitler, E. Reyes, R. H. Villarreal (2010). Ring graphs and complete intersection toric ideals. Discrete Mathematics, Vol. 310, No. 3. DOI: https://doi.org/10.1016/j.disc.2009.03.020
Mahdi Reza Khorsandi (2020). Graphs whose line graphs are ring graphs. AKCE International Journal of Graphs and Combinatorics, Volume 17, páginas 801-803, Issue 3. DOI: https://doi.org/10.1016/j.akcej.2019.10.002
R. H. Villarreal (2003). Monomial Algebras and Polyhedral Geometry. Handbook of Algebra, Vol. 3, 257–314, Elsevier Science B.V., Amsterdam. DOI: https://doi.org/10.1016/S1570-7954(03)80063-3
Shengli Jiang, Shiyi Qin, Reid C. VanLehn, Prasanna Balaprakash and Victor M. Zavala (2023). Uncertainty Quantification for Molecular Property Predictions with Graph Neural Architecture Search. ArXiv preprint. DOI: https://doi.org/10.1039/D4DD00088A
HaiLan, Xian Wei (2023). Simplicial Message Passing for Chemical Property Prediction. Preprint ArXiv.
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Jonathan Toledo Toledo, Nancy Márquez Lazaro, Azucena Escobar Santiago, Darío Salvador Garcia
This work is licensed under a Creative Commons Attribution 4.0 International License.
