M-polynomial based topological properties of Sudoku graphs
From MaRDI portal
Publication:5035015
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Orthogonal arrays, Latin squares, Room squares (05B15) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graph designs and isomorphic decomposition (05C51) Chemical graph theory (05C92)
Recommendations
- Computing topological indices of sudoku graphs
- \(M\)-polynomial and degree-based topological indices
- \(M\)-polynomial and degree-based topological indices of graphs
- On the M-polynomials and degree-based topological indices of an important class of graphs
- Computing irregularity measures for sudoku graph
Cites work
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Augmented Zagreb index
- Computing three topological indices for titania nanotubes \(\mathrm{TiO}_2[m,n]\)
- Graphs of extremal weights
- Note on two generalizations of the Randić index
- On topological indices of fullerenes
- The Wiener polarity index of graph products.
- \(M\)-polynomial and degree-based topological indices
Cited in
(5)
This page was built for publication: M-polynomial based topological properties of Sudoku graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5035015)