66 citations · 78 across the 9 of their papers we have counts for
4 papers · 1 filter
Novel Inequalities for Generalized Graph Entropies Revisited, Graph Energies and Topological Indices
Xueliang Li, Zhongmei Qin, Meiqin Wei +2
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to informatio…
Additive codes over from circulant graphs
Ruihu Li, Xueliang Li, Yaping Mao +1
In , Danielsen and Parker \cite{DP} proved that every self-dual additive code over is equivalent to a graph code. So, graph is an important tool for searching (propos…
Formally self-dual linear binary codes from circulant graphs
Ruihu Li, Xueliang Li, Yaping Mao +1
In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In t…
On a conjecture about tricyclic graphs with maximal energy
Xueliang Li, Yongtang Shi, Meiqin Wei +1
For a given simple graph , the energy of , denoted by , is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix, which was de…