%0 Journal Article
%T Energy of binary labeled graphs
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Bhat, Pradeep G.
%A D'Souza, Sabitha
%D 2013
%\ 09/01/2013
%V 2
%N 3
%P 53-67
%! Energy of binary labeled graphs
%K Label Matrix
%K Label Eigenvalues
%K Label Energy
%R 10.22108/toc.2013.3292
%X 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.
%U https://toc.ui.ac.ir/article_3292_782073aa78bf670706945d083a62986b.pdf