M-polynomial based topological properties of Sudoku graphs
DOI10.1080/09720529.2019.1677310zbMATH Open1483.05029OpenAlexW3005911529MaRDI QIDQ5035015FDOQ5035015
Authors: Muhammad Kamran Aslam, M. Javaid, A. Raheem 
Publication date: 21 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2019.1677310
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmented Zagreb index
- Graphs of extremal weights
- On topological indices of fullerenes
- Computing three topological indices for titania nanotubes \(\mathrm{TiO}_2[m,n]\)
- Note on two generalizations of the Randić index
- The Wiener polarity index of graph products.
- M-Polynomial and Degree-Based Topological Indices
Cited In (3)
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)
