Extremal values of degree-based entropies of bipartite graphs
From MaRDI portal
Publication:6562294
Recommendations
Cites work
- scientific article; zbMATH DE number 4173021 (Why is no real title available?)
- scientific article; zbMATH DE number 3006493 (Why is no real title available?)
- scientific article; zbMATH DE number 6127695 (Why is no real title available?)
- An entropy approach to the hard-core model on bipartite graphs
- Bipartite graphs with the maximum sum of squares of degrees
- Difference graphs
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Extremal problems for graphical function-indices and \(f\)-weighted adjacency matrix
- Extremality of degree-based graph entropies
- Extreme values of the sum of squares of degrees of bipartite graphs
- First degree-based entropy of graphs
- Five results on maximizing topological indices in graphs
- Graphs with minimum vertex-degree function-index for convex functions
- Local laws of the \(\omega\) function in almost all short intervals
- Maximum values of degree-based entropies of bipartite graphs
- Multiplicative functions in short intervals
- On the extremal values of general degree-based graph entropies
- Resolution of Yan's conjecture on entropy of graphs
- The Zagreb indices of bipartite graphs with more edges
- The number of independent sets in a regular graph
- The wonderful Walecki construction
- Threshold graphs and related topics
- Topological structure of extremal graphs on the first degree-based graph entropies
- Unified extremal results of topological indices and spectral invariants of graphs
- Wide partitions, Latin tableaux, and Rota's basis conjecture
This page was built for publication: Extremal values of degree-based entropies of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562294)