Related Experiment Video
Updated: Feb 19, 2026

Assessment of Dendritic Arborization in the Dentate Gyrus of the Hippocampal Region in Mice
Published on: March 31, 2015
Degree sequence for k-arc strongly connected multiple digraphs
1College of Mathematics and Computer Science, Fuzhou University, Fuzhou, 350108 P.R. China.
Abstract:
Let D be a digraph on [Formula: see text]. Then the sequence [Formula: see text] is called the degree sequence of D. For any given sequence of pairs of integers [Formula: see text], if there exists a k-arc strongly connected digraph D such that d is the degree sequence of D, then d is realizable and D is a realization of d. In this paper, characterizations for k-arc-connected realizable sequences and realizable sequences with arc-connectivity exactly k are given.
Related Concept Videos
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Arc Length Function
Graphs of Equations in Two Variables
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...
Graphs of Functions
Graphical Representation of Inequalities

