Computing topological indices of sudoku graphs
From MaRDI portal
Recommendations
- Computing irregularity measures for sudoku graph
- On topological indices of certain interconnection networks
- M-polynomial based topological properties of Sudoku graphs
- On topological indices of honeycomb networks and Graphene networks
- On certain topological indices of the line graph of subdivision graphs
Cites work
- A note on the Boardman theorem
- An efficient representation of Benes networks and its applications
- Collective behavior and evolutionary games -- an introduction
- Computation of topological indices of certain networks
- Graphs of extremal weights
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 5251354 (Why is no real title available?)
- scientific article; zbMATH DE number 3225079 (Why is no real title available?)
- On minimum metric dimension of honeycomb networks
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On topological indices of certain interconnection networks
- Promoting cooperation in social dilemmas via simple coevolutionary rules
- Series expansion of the directed percolation probability
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
Cited in
(3)
This page was built for publication: Computing topological indices of sudoku graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677121)