Nordhaus-Gaddum type results for graph irregularities
From MaRDI portal
Publication:2008199
DOI10.1016/j.amc.2018.09.057zbMath1428.05154OpenAlexW2897175540WikidataQ129086430 ScholiaQ129086430MaRDI QIDQ2008199
Yuede Ma, Matthias Dehmer, Yongtang Shi, Cheng-yi Xia, Shu-Juan Cao
Publication date: 22 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.09.057
Related Items (3)
Note on the perfect Roman domination number of graphs ⋮ The sigma coindex of graph operations ⋮ Lower bounds on the irregularity of trees and unicyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree powers in \(C_5\)-free graphs
- On reciprocal molecular topological index
- A note on the irregularity of graphs
- An upper bound on the sum of squares of degrees in a graph
- Degree-based entropies of networks revisited
- Note on two generalizations of the Randić index
- Sharp bounds for the Randić index of graphs with given minimum and maximum degree
- Degree powers in graphs with a forbidden forest
- Network entropies based on independent sets and matchings
- A survey of Nordhaus-Gaddum type relations
- Analyzing lattice networks through substructures
- Vertex-based and edge-based centroids of graphs
- Rainbow trees in graphs and generalized connectivity
- On Complementary Graphs
- Comparing the irregularity and the total irregularity of graphs
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- The total irregularity of a graph
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
This page was built for publication: Nordhaus-Gaddum type results for graph irregularities
