Upper bounds on the sum of powers of the degrees of a simple planar graph
From MaRDI portal
Publication:3005113
DOI10.1002/JGT.20519zbMATH Open1217.05072OpenAlexW2077339325MaRDI QIDQ3005113FDOQ3005113
Stanislav Jendroľ, Tomáš Madaras, Jochen Harant
Publication date: 7 June 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20519
Cites Work
- Title not available (Why is that?)
- Maximizing the sum of the squares of the degrees of a graph
- An upper bound on the sum of squares of degrees in a graph
- Sums of powers of the degrees of a graph
- An upper bound on the sum of squares of degrees in a hypergraph
- Vertex degrees of planar graphs
- On p-vectors of 3-polytopes
- Note on vertex degrees of planar graphs
Cited In (7)
- The first general Zagreb index of graphs and their line graphs
- Upper bound on the sum of powers of the degrees of graphs with few crossings per edge
- On the sum of powers of the degrees of graphs
- An upper bound on the sum of powers of the degrees of simple 1-planar graphs
- On degree sums of a triangle-free graph
- The outdegree power of oriented graphs
- Degree powers in \(K_{s,t}\)-minor free graphs
This page was built for publication: Upper bounds on the sum of powers of the degrees of a simple planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005113)
