Nordhaus-Gaddum type results for graph irregularities
From MaRDI portal
Publication:2008199
DOI10.1016/J.AMC.2018.09.057zbMATH Open1428.05154OpenAlexW2897175540WikidataQ129086430 ScholiaQ129086430MaRDI QIDQ2008199FDOQ2008199
Authors: Yue-de Ma, Yongtang Shi, Matthias Dehmer, Shu-Juan Cao, Cheng-Yi Xia 
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
Recommendations
- Some new results on irregularity of graphs
- Nordhaus-Gaddum results for CO-irredundance in graphs
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- Generalised irredundance in graphs: Nordhaus-Gaddum bounds
- On Eulerian irregularity in graphs
- scientific article
- Graphs with maximal \(\sigma\) irregularity
- Nordhaus-Gaddum type results for the Harary index of graphs
- A note on the irregularity of graphs
- Some new spectral bounds for graph irregularity
Cites Work
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
- Title not available (Why is that?)
- Rainbow trees in graphs and generalized connectivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Degree-based entropies of networks revisited
- A survey of Nordhaus-Gaddum type relations
- On Complementary Graphs
- Degree powers in \(C_5\)-free graphs
- Title not available (Why is that?)
- An upper bound on the sum of squares of degrees in a graph
- A note on the irregularity of graphs
- On reciprocal molecular topological index
- Note on two generalizations of the Randić index
- Sharp bounds for the Randić index of graphs with given minimum and maximum degree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analyzing lattice networks through substructures
- Vertex-based and edge-based centroids of graphs
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- Network entropies based on independent sets and matchings
- Degree powers in graphs with a forbidden forest
- The total irregularity of a graph
- Comparing the irregularity and the total irregularity of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Nordhaus-Gaddum type results for graph irregularities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008199)
