On extremal bipartite graphs with given number of cut edges

DOI10.1142/S1793830920500159zbMath1456.05035WikidataQ126770768 ScholiaQ126770768MaRDI QIDQ5854744

Renfang Wu, Han Lin Chen

Publication date: 18 March 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

monotonicitybipartite graphstopological indicescut edges

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (3)

Wiener Index, Kirchhoff Index in Graphs with Given Girth and Maximum Degree ⋮ Unnamed Item ⋮ General eccentric distance sum of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the extremal total reciprocal edge-eccentricity of trees
• The extremal values of some topological indices in bipartite graphs with a given matching number
• Further results on the eccentric distance sum
• Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
• Wiener index and Harary index on Hamilton-connected graphs with large minimum degree
• On the monotonicity of topological indices and the connectivity of a graph
• On eccentric distance sum and degree distance of graphs
• Wiener index, Harary index and graph properties
• Trees with the maximal value of Graovac-Pisanski index
• On the minimum eccentric distance sum of bipartite graphs with some given parameters
• On the maximal connective eccentricity index of bipartite graphs with some given parameters
• On two eccentricity-based topological indices of graphs
• On the sum of all distances in bipartite graphs
• Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number

This page was built for publication: On extremal bipartite graphs with given number of cut edges