Upper bound on the sum of powers of the degrees of graphs with few crossings per edge
From MaRDI portal
Publication:2009245
DOI10.1016/j.amc.2019.01.002zbMath1428.05069OpenAlexW2911077184WikidataQ128553817 ScholiaQ128553817MaRDI QIDQ2009245
Publication date: 27 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.2019.01.002
degree sumcrossing number\(q\)-planar graphfirst general Zagreb indexgeneral zeroth-order randić index
Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On degree sums of a triangle-free graph
- Sharp bounds on the zeroth-order general Randić index of unicyclic graphs with given diameter
- On the zeroth-order general Randić index
- Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index
- Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
- Graphs drawn with few crossings per edge
- An upper bound on the sum of squares of degrees in a hypergraph
- An upper bound on the sum of squares of degrees in a graph
- Note on two generalizations of the Randić index
- Degree powers in graphs with a forbidden forest
- Maximizing the sum of the squares of the degrees of a graph
- An upper bound on the sum of powers of the degrees of simple 1-planar graphs
- Sums of powers of the degrees of a graph
- ON THE SUM OF POWERS OF THE DEGREES OF GRAPHS
- Upper bounds on the sum of powers of the degrees of a simple planar graph
- Note on vertex degrees of planar graphs
- The star sequence and the general first Zagreb index
- The crossing number of K5,n
- On a problem of P. Turan concerning graphs
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
This page was built for publication: Upper bound on the sum of powers of the degrees of graphs with few crossings per edge