Related Experiment Video
Updated: Jun 19, 2025

Revealing Neural Circuit Topography in Multi-Color
Published on: November 14, 2011
The local vertex anti-magic coloring for certain graph operations
1Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore 632 014, India.
Abstract:
This work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs . Let G be either or , F is a 1-factor. Also, we discover the local vertex anti-magic coloring for union of bipartite graphs; join graphs , where ; and the upper bound of corona product . It was a problem Lau and Shiu (2023) [1] that: For any and , determine . We give partial answer to this problem by proving the followings:1. ;2. ; and3. , where .
Related Concept Videos
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...
Gradient and Del Operator
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Vector Operations
A vector multiplied by a scalar value is called scalar multiplication. The result obtained is a new vector with a different magnitude. If the scalar is positive, the direction of the vector remains the same, but if it is negative, the direction of the vector is reversed. For example, the product of the mass and velocity yields the momentum.
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Nodal Analysis with Voltage Sources
Consider a circuit that contains four resistors and two voltage sources, as shown in Figure 1. One of these voltage sources is connected between a...

