A novel labeling algorithm on several classes of graphs
From MaRDI portal
Recommendations
- On super totient numbers, with applications and algorithms to graph labeling.
- On super totient numbers and super totient labelings of graphs
- New numbers on Euler's totient function with applications.
- A paradigmatic approach to investigate restricted totient graphs and their indices
- Super mean labeling of graphs.
Cited in
(16)- Classification of upper bound sequences of local fractional metric dimension of rotationally symmetric hexagonal planar networks
- Structures of power digraphs over the congruence equation \(x^p\equiv y\; (\text{mod}\; m)\) and enumerations
- A paradigmatic approach to investigate restricted hyper totient graphs
- On super totient numbers and super totient labelings of graphs
- A result on graph labelling
- A paradigmatic approach to investigate restricted totient graphs and their indices
- scientific article; zbMATH DE number 5178701 (Why is no real title available?)
- scientific article; zbMATH DE number 3957157 (Why is no real title available?)
- Exceptional totient numbers
- New numbers on Euler's totient function with applications.
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover
- On super totient numbers, with applications and algorithms to graph labeling.
- Novel classes of integers and their applications in graph labeling
- On k-fold super totient numbers
- A general label search to investigate classical graph search algorithms
- Structural properties of the graphs arising from congruences over set of moduli
This page was built for publication: A novel labeling algorithm on several classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605900)
