Related Experiment Video
Updated: Oct 13, 2025

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
Computing locating-total domination number in some rotationally symmetric graphs
Hassan Raza1, Naveed Iqbal2, Hamda Khan3
1Business School, 47863University of Shanghai for Science and Technology, Shanghai, China.
Abstract:
Let be a connected graph. A locating-total dominating set in a graph G is a total dominating set S of a G, for every pair of vertices , such that . The minimum cardinality of a locating-total dominating set is called locating-total domination number and represented as . In this paper, locating-total domination number is determined for some cycle-related graphs. Furthermore, some well-known graphs of convex polytopes from the literature are also considered for the locating-total domination number.
Related Concept Videos
Norton's Theorem
Coordination Number and Geometry
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Parallel-axis Theorem
Theorems of Pappus and Guldinus: Problem Solving
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...

