In this study, we aim to determine the unique tetracyclic graph that maximizes the signless Laplacian Estrada index (SLEE) among all tetracyclic graphs. The SLEE of a graph Ω is defined as the sum of ...
This is a preview. Log in through your library . Abstract A signed graph consists of a (simple) graph G = (V, E) together with a function σ : E {+; −} called signature. Matrices can be associated to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback