Öz, Mert Sinan2024-07-122024-07-122019-01-011658-3655https://doi.org/10.1080/16583655.2018.1555989https://hdl.handle.net/11452/43255Modelling a chemical compound by a (molecular) graph helps us to obtain some required information about the chemical and physical properties of the corresponding molecular structure. Linear algebraic notions and methods are used to obtain several properties of graphs usually by the help of some graph matrices and these studies form an important sub area of Graph Theory called spectral graph theory. In this paper, we deal with the sum-edge matrices defined by means of vertex degrees. We calculate the sum-edge characteristic polynomials of several important graph classes by means of the corresponding sum-edge matrices.eninfo:eu-repo/semantics/closedAccessGraphsAdjacencySum-edge characteristic polynomial05c5005c3105c3805c07Science & technologyMultidisciplinary sciencesScience & technology - other topicsArticle00045272330000119320013110.1080/16583655.2018.1555989