@article {
author = {Bhat, Pradeep and D'Souza, Sabitha},
title = {Energy of binary labeled graphs},
journal = {Transactions on Combinatorics},
volume = {2},
number = {3},
pages = {53-67},
year = {2013},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2013.3292},
abstract = {Let $G$ be a graph with vertex set $V(G)$ and edge set $X(G)$ and consider the set $A=\{0,1\}$. A mapping $l:V(G)\longrightarrow A$ is called binary vertex labeling of $G$ and $l(v)$ is called the label of the vertex $v$ under $l$. In this paper we introduce a new kind of graph energy for the binary labeled graph, the labeled graph energy $E_{l}(G)$. It depends on the underlying graph $G$ and on its binary labeling, upper and lower bounds for $E_{l}(G)$ are established. The labeled energies of a number of well known and much studied families of graphs are computed.},
keywords = {Label Matrix,Label Eigenvalues,Label Energy},
url = {https://toc.ui.ac.ir/article_3292.html},
eprint = {https://toc.ui.ac.ir/article_3292_782073aa78bf670706945d083a62986b.pdf}
}