Results 261 to 270 of about 3,829,561 (285)
Some of the next articles are maybe not open access.
On the ABC index of connected graphs with given degree sequences
Journal of Mathematical Chemistry, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
ABC Algorithm-Based Subblocks Set Design for OFDM With All Index Modulation
IEEE Communications Letters, 2020In this letter, we propose a low complexity artificial bee colony (ABC) algorithm based subblocks set design to maximize the diversity gain of orthogonal frequency division multiplexing with all index modulation (OFDM-AIM), which is inspired by OFDM with index modulation (OFDM-IM).
Mahmut Yildirim
exaly +3 more sources
Which tree has the smallest ABC index among trees with k leaves?
Discrete Applied Mathematics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman, Colton Magnant
exaly +5 more sources
On ABC Estrada index of graphs
Discrete Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuchao Li, Lu Wang, Huihui Zhang 0002
openaire +1 more source
The ABC Index Conundrum's Complete Solution
Match - Communications in Mathematical and in Computer Chemistry, 2023The problem of complete characterization of trees with minimal atom-bond-connectivity index (minimal-ABC trees) has a reputation as one of the most challenging and intriguing open problems in mathematical chemistry. Recently, the problem has been completely solved. Here, we provide an overview of the key results that led to its complete solution.
Dimitrov, Darko, Du, Zhibin
openaire +1 more source
Computer search for large trees with minimal ABC index
Applied Mathematics and Computation, 2018Abstract The atom-bond connectivity ( ABC ) index of a graph G = ( V, E ) is defined as A B C ( G ) = ∑ v i v j ∈ E ( d i + d j − 2 ) / ( d i d j ) , where V = { v 0 , v 1 ,⋅⋅⋅, v n − 1 } and d i denotes the degree of vertex v i of G .
Wenshui Lin +4 more
openaire +1 more source
New Upper Bounds for the ABC Index
2016For a connected undirected graph G = (V;E) with vertex set {1; 2;: :: ; n} and degrees di, for 1≤ i≤ n, we show that ABC(G)≤ → (n-1)(|E|-R-1(G)); where R-1(G) = ∑ (i;j)εE 1/didj is the Randić index. This bound allows us to obtain some maximal results for the ABC index with elementary proofs and to improve all the upper bounds in [20], as well as some ...
Cornaro, Alessandra +3 more
openaire +2 more sources
From ABC to http: The Effervescent Evolution of Indexing for Audiovisual Materials
Cataloging & Classification Quarterly, 2010Indexing methods for audiovisual materials had not yet settled when the arrival of the World Wide Web upset any stability that existed in this area. New possibilities have now opened up for indexing digital audiovisual materials in a networked environment. This article, traces some of the methods used for organizing collections of audiovisual materials,
openaire +1 more source
A new method for computing ABC index of nanostar dendrimers
2013The ABC index is a topological index was defined as $ABC(G)=sum_{uvin E}sqrt{(d_G (u) +d_G (v )- 2)/d_G (u)d_G (v )} $, where $d_G(u)$ denotes degree of vertex u. The second version of ABC index is defined as $ABC_2(G)=sum_{uvin E}sqrt{(n_u+n_v-2)/n_un_v} $ where $n_u $is the number of vertices closer to vertex u than v.
openaire +1 more source
Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
Discret. Appl. Math., 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaodan Chen, Kinkar Chandra Das
openaire +2 more sources