The minimum mean monopoly energy of a graph
Künye
Rao, M. V. C., Venkatesh, K. A. & Lakshmi Dasari, V. (2021). The minimum mean monopoly energy of a graph. TWMS Journal of Applied and Engineering Mathematics, 11(SI), 144-153.Özet
The motivation for the study of the graph energy comes from chemistry, where the research on the so-called total pi - electron energy can be traced back until the 1930s. This graph invariant is very closely connected to a chemical quantity known as the total pi - electron energy of conjugated hydro carbon molecules. In recent times analogous energies are being considered, based on Eigen values of a variety of other graph matrices. In 1978, I.Gutman [1] defined energy mathematically for all graphs. Energy of graphs has many mathematical properties which are being investigated. The ordinary energy of an undirected simple finite graph G is defined as the sum of the absolute values of the Eigen values of its associated matrix. i.e. if mu(1), mu(2), ..., mu(n) are the Eigen values of adjacency matrix A(G), then energy of graph is Sigma(G) = Sigma(n)(i=1) vertical bar mu(i)vertical bar Laura Buggy, Amalia Culiuc, Katelyn Mccall and Duyguyen [9] introduced the more general M-energy or Mean Energy of G is then defined as E-M (G) = Sigma(n)(i=1)vertical bar mu(i) - (mu) over bar vertical bar, where (mu) over bar vertical bar is the average of mu(1), mu(2), ..., mu(n). A subset M subset of V (G), in a graph G (V, E), is called a monopoly set of G if every vertex v is an element of (V - M) has at least d(v)/2 neighbors in M. The minimum cardinality of a monopoly set among all monopoly sets in G is called the monopoly size of G, denoted by mo(G) Ahmed Mohammed Naji and N.D.Soner [7] introduced minimum monopoly energy E-MM [G] of a graph G. In this paper we are introducing the minimum mean monopoly energy, denoted by E-MM(M) (G), of a graph G and computed minimum monopoly energies of some standard graphs. Upper and lower bounds for E-MM(M) (G)are also established.
Kaynak
TWMS Journal of Applied and Engineering MathematicsCilt
11Sayı
SIBağlantı
https://hdl.handle.net/11729/3030http://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/643
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Pilot-aided bayesian MMSE channel estimation for OFDM systems: Algorithm and performance analysis
Şenol, Habib; Çırpan, Hakan Ali; Panayırcı, Erdal (IEEE, 2004)This paper proposes a computationally efficient, pilot-aided minimum mean square error (MMSE) channel estimation algorithm for OFDM systems. The proposed approach employs a convenient representation of the discrete multipath ... -
Intermittent resources assessment on power grid under an hourly scaled bottom-up model
Bulut, Nurdan Yağmur (Işık Üniversitesi, 2022-07-04)This study aims to model and examine the Turkish electricity sector by using TIMES modeling framework. It attempts to investigate the decisions of the proposed model under various scenarios. As the energy need grows globally, ... -
Frequency selective fading channel estimation in OFDM systems using KL expansion
Şenol, Habib; Çırpan, Hakan Ali; Panayırcı, Erdal (IEEE, 2005)This paper proposes a computationally efficient, linear minimum mean square error (MMSE) channel estimation algorithm based on KL series expansion for OFDM systems. Based on such expansion, no matrix inversion is required ...