On \(ve\)-degree and \(ev\)-degree of graphs

DOI10.1016/j.disopt.2018.07.002zbMath1506.05048OpenAlexW2884145665MaRDI QIDQ2419356

Yanyan Li

Publication date: 13 June 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2018.07.002

zbMATH Keywords

irregularityedge-vertex degreevertex-edge degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (4)

Graphs with maximum irregularity ⋮ On the maximum size of stepwise irregular graphs ⋮ Comparative study of vertex-edge based indices for semi-capped carbon nanotubes ⋮ Vertex-edge domination in unit disk graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete characterization of graphs for direct comparing Zagreb indices
• On maximally irregular graphs
• On difference of Zagreb indices
• Degree sequences of highly irregular graphs
• Highly irregular graphs with extreme numbers of edges
• Maximizing the sum of the squares of the degrees of a graph
• On ve-degree molecular topological properties of silicate and oxygen networks
• On \(ve\)-degrees and \(ev\)-degrees in graphs
• Graphs with maximal irregularity
• How to Define an Irregular Graph
• Comparing the irregularity and the total irregularity of graphs
• Highly irregular graphs
• No Graph is Perfect

This page was built for publication: On \(ve\)-degree and \(ev\)-degree of graphs