An extended hypergraph cut method for the Wiener index
From MaRDI portal
Cites work
- \(k\)-Wiener index of a \(k\)-plex
- A new method to find the Wiener index of hypergraphs
- Application of hypergraph theory in chemistry
- Associativity and non-associativity of some hypergraph products
- Computing the Mostar index in networks with applications to molecular graphs
- Degree-based indices of hypergraphs: definitions and first results
- Extended cut method for edge Wiener, Schultz and Gutman indices with applications
- Fast factorization of Cartesian products of (directed) hypergraphs
- Fully gated graphs: Recognition and convex operations
- Generalized cut method for computing the edge-Wiener index
- scientific article; zbMATH DE number 5005356 (Why is no real title available?)
- Isometric embeddings into cube-hypergraphs
- On degree distance of hypergraphs
- On distance spectral radius of uniform hypergraphs with cycles
- On the eccentric connectivity index of uniform hypergraphs
- On the Laplacian spectrum of k-uniform hypergraphs
- Spectra of hyperstars
- The cut method on hypergraphs for the Wiener index
- The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- The Wiener index of \(r\)-uniform hypergraphs
- The Wiener index of hypergraphs
- Two-point resistances in the generalized phenylenes
- Wiener number of vertex-weighted graphs and a chemical application
This page was built for publication: An extended hypergraph cut method for the Wiener index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7011772)