The cut method on hypergraphs for the Wiener index
From MaRDI portal
Publication:6173950
DOI10.1007/s10910-023-01478-4zbMath1518.05043arXiv2303.11644OpenAlexW4367048712MaRDI QIDQ6173950
Sandi Klavžar, Gašper Domen Romih
Publication date: 13 July 2023
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.11644
Hypergraphs (05C65) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Associativity and non-associativity of some hypergraph products
- A new method to find the Wiener index of hypergraphs
- Fast factorization of Cartesian products of (directed) hypergraphs
- On the notion of cycles in hypergraphs
- Isometric embeddings into cube-hypergraphs
- On distance spectral radius of uniform hypergraphs with cycles
- The Szeged index and the Wiener index of partial cubes with applications to chemical graphs
- On the eccentric connectivity index of uniform hypergraphs
- \(k\)-Wiener index of a \(k\)-plex
- On the Laplacian spectrum of \(k\)-uniform hypergraphs
- On the first three minimum Mostar indices of tree-like phenylenes
- Generalized cut method for computing the edge-Wiener index
- Two-point resistances in the generalized phenylenes
- Tutte polynomials of alternating polycyclic chains
- The Wiener index of hypergraphs
- The Wiener index of \(r\)-uniform hypergraphs
- Fully gated graphs: Recognition and convex operations
- Computing the Mostar index in networks with applications to molecular graphs
- Application of hypergraph theory in chemistry
- A Method for Computing the Edge-Hosoya Polynomial with Application to Phenylenes
This page was built for publication: The cut method on hypergraphs for the Wiener index
