Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

13.1K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
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...
13.1K
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

788
Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...
788
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

202
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
202
Lattice Centering and Coordination Number02:33

Lattice Centering and Coordination Number

9.8K
The structure of a crystalline solid, whether a metal or not, is best described by considering its simplest repeating unit, which is referred to as its unit cell. The unit cell consists of lattice points that represent the locations of atoms or ions. The entire structure then consists of this unit cell repeating in three dimensions. The three different types of unit cells present in the cubic lattice are illustrated in Figure 1.
Types of Unit Cells
Imagine taking a large number of identical...
9.8K
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

384
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
384
Routh-Hurwitz Criterion I01:15

Routh-Hurwitz Criterion I

323
Consider an electrical power grid, where stability is essential to prevent blackouts. The Routh-Hurwitz criterion is a valuable tool for assessing system stability under varying load conditions or faults. By analyzing the closed-loop transfer function, the Routh-Hurwitz criterion helps determine whether the system remains stable.
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
323

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

On derived t-path, t=2,3 signed graph and t-distance signed graph.

MethodsX·2025
Same author

Dynamic Muscle Function Parameters in Indian Children and Adolescents with Type 1 Diabetes Mellitus: A Case-Control Study.

Indian journal of endocrinology and metabolism·2024
Same author

Comparison of microbiome isolated from the conjunctiva, contact lens and lens storage case of symptomatic and asymptomatic contact lens users.

Iranian journal of microbiology·2020
Same author

Study of biofilm formation in bacterial isolates from contact lens wearers.

Indian journal of ophthalmology·2019
Same author

Characterization of 2-Path Product Signed Graphs with Its Properties.

Computational intelligence and neuroscience·2017
Same author

An Algorithm to detect balancing of iterated line sigraph.

SpringerPlus·2017
Same journal

Method development and validation for microscopic measurement of the fluorescence spectrum of sedimentary organic matter in geologic samples.

MethodsX·2026
Same journal

Simplified method for EEG recordings in mice.

MethodsX·2026
Same journal

Migrant patients in intensive care units: nursing role and cultural adaptation of humanization models - A scoping review protocol.

MethodsX·2026
Same journal

Meta-EEGs: A structured approach for processing high-volume EEG data.

MethodsX·2026
Same journal

A robust dilute-and-inject ion chromatography - Tandem mass spectrometry for urinary glyphosate quantification.

MethodsX·2026
Same journal

A practical approach to a single-chain variable fragment (scFv) biotinylating for immunohistochemical analysis.

MethodsX·2026
See all related articles

Related Experiment Video

Updated: Sep 2, 2025

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.3K

Algorithmic approach to find -consistency in Common-Edge signed graph.

Anshu Sethi1, Deepa Sinha2, Obaidullah Wardak2

  • 1The North Cap University, India.

Methodsx
|August 9, 2022
PubMed
Summary
This summary is machine-generated.

This study introduces an algorithm to determine if a signed graph is common-edge consistent. The research also analyzes the complexity of this consistency detection algorithm.

Keywords:
AlgorithmCommon-Edge signed graphConsistent marked graphNegative sectionSigned graph

More Related Videos

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.3K
Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

552

Related Experiment Videos

Last Updated: Sep 2, 2025

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
10:44

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

Published on: December 7, 2021

2.3K
Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.3K
Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

552

Area of Science:

  • Graph Theory
  • Discrete Mathematics
  • Computer Science

Background:

  • Introduces the concept of a common-edge signed graph derived from an initial signed graph.
  • Defines a marked signed graph and the condition for a signed graph to be common-edge consistent.

Purpose of the Study:

  • To develop and present an algorithm for detecting common-edge consistency in signed graphs.
  • To determine the computational complexity of the proposed algorithm.

Main Methods:

  • An algorithm is designed to systematically check for common-edge consistency.
  • The algorithm's performance is analyzed to establish its time and space complexity.

Main Results:

  • A novel algorithm for detecting common-edge consistency in signed graphs is presented.
  • The complexity of the developed algorithm is determined, providing insights into its efficiency.

Conclusions:

  • The study provides a computational method for assessing common-edge consistency in signed graphs.
  • The complexity analysis offers a quantitative understanding of the algorithm's resource requirements.