The outdegree power of oriented graphs
From MaRDI portal
Publication:6653949
DOI10.1007/s40314-024-03001-0MaRDI QIDQ6653949
Publication date: 17 December 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sums of powers of the degrees of graphs with \(k\) cut edges
- Degree powers in \(C_5\)-free graphs
- Extreme values of the sum of squares of degrees of bipartite graphs
- Number of walks and degree powers in a graph
- A Turán type problem concerning the powers of the degrees of a graph
- An upper bound on the sum of squares of degrees in a graph
- Degree powers in graphs with a forbidden forest
- Maximizing the sum of the squares of the degrees of a graph
- Degree powers in graphs with forbidden subgraphs
- Degree powers in \(K_{s,t}\)-minor free graphs
- The maximum outdegree power of complete \(k\)-partite oriented graphs
- Degree powers in graphs with a forbidden even cycle
- 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
- Degree Powers in Graphs: The Erdős–Stone Theorem
- Upper bounds on the sum of powers of the degrees of a simple planar graph
- Eigenvalues and triangles in graphs
This page was built for publication: The outdegree power of oriented graphs
