Energy of binary labeled graphs
Let G be graph with vertex set V(G) and edge set E(G) and the set A={0,1}. A mapping 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. It depends on...
Main Authors: | Pradeep G. Bhat, Sabitha D'Souza |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2013-09-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=3292&_ob=604efb3027cda235d21ecd34e2a19b18&fileName=full_text.pdf. |
Similar Items
-
Neutrosophic Labeling Graph
by: M. Gomathi, et al.
Published: (2019-12-01) -
Properly even harmonious labelings of disconnected graphs
by: Joseph A. Gallian, et al.
Published: (2015-11-01) -
- and -labeling problems on interval graphs
by: Sk Amanathulla, et al.
Published: (2017-12-01) -
Even harmonious labelings of disjoint graphs with a small component
by: Joseph A. Gallian, et al.
Published: (2015-11-01) -
A Study on Topological Integer Additive Set-Labeling of Graphs
by: Sudev Naduvath
Published: (2015-03-01)