On extremal bipartite graphs with a given connectivity
From MaRDI portal
Publication:5080778
DOI10.2298/FIL1906531CzbMath1499.05326MaRDI QIDQ5080778
Hanyuan Deng, Han Lin Chen, Renfagn Wu
Publication date: 31 May 2022
Published in: Filomat (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Wiener and multiplicative Wiener indices of graphs
- The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
- On maximum Estrada indices of bipartite graphs with some given parameters
- On Harary index of graphs
- On the distance spectral radius of bipartite graphs
- On extremal Zagreb indices of trees with given domination number
- The extremal values of some topological indices in bipartite graphs with a given matching number
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity
- On the sum of squares of degrees and products of adjacent degrees
- The \((n,n)\)-graphs with the first three extremal Wiener indices
- On the monotonicity of topological indices and the connectivity of a graph
- Wiener indices of spiro and polyphenyl hexagonal chains
- On the distance Laplacian spectral radius of bipartite graphs
- On the sum of all distances in bipartite graphs
- Extremal topological indices for graphs of given connectivity
- Properties of the Hyper-Wiener index as a local function
- Independent sets on the Towers of Hanoi graphs
- Graph connectivity and Wiener index
This page was built for publication: On extremal bipartite graphs with a given connectivity
