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

Bewley Lattice Diagram01:12

Bewley Lattice Diagram

1.5K
The Bewley lattice diagram, developed by L. V. Bewley, effectively organizes the reflections occurring during transmission-line transients. It visually represents how voltage waves propagate and reflect within a transmission line, making it easier to understand the complex interactions that occur.
1.5K
Signal Flow Graphs01:18

Signal Flow Graphs

684
Signal-flow graphs offer a streamlined and intuitive approach to representing control systems, providing an alternative to traditional block diagrams. These graphs use branches to symbolize systems and nodes to represent signals, effectively illustrating the relationships and interactions within the system.
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
684
Boundary Conditions: Lossless Lines01:21

Boundary Conditions: Lossless Lines

449
Consider a single-phase, two-wire, lossless transmission line terminated by an impedance at the receiving end and a source with Thevenin voltage and impedance at the sending end. The line, with length, has a surge impedance and wave velocity determined by the line's inductance and capacitance.
At the receiving end, the boundary condition states that the voltage equals the product of the receiving-end impedance and current. This relationship is expressed as a function of the incident and...
449
SFG Algebra01:16

SFG Algebra

362
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
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...
362
Rigid Body Equilibrium Problems - II01:21

Rigid Body Equilibrium Problems - II

8.1K
A rigid body is in static equilibrium when the net force and the net torque acting on the system are equal to zero.
Consider two children sitting on a seesaw, which has negligible mass. The first child has a mass (m1) of 26 kg and sits at point A, which is 1.6 meters (r1) from the pivot point B; the second child has a mass (m2) of 32 kg and sits at point C. How far from the pivot point B should the second child sit (r2) to balance the seesaw?
8.1K
Method of Sections01:30

Method of Sections

1.3K
Consider a truss structure, as shown in the figure.
1.3K

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

Algorithmic approach to find <math></math> -consistency in Common-Edge signed graph.

MethodsX·2022
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 journal

In-silico combinatorial design and pharmacophore modeling of potent antimalarial 4-anilinoquinolines utilizing QSAR and computed descriptors.

SpringerPlus·2017
Same journal

Erratum to: Implication of Paris Agreement in the context of long-term climate mitigation goals.

SpringerPlus·2017
Same journal

Erratum to: Associations between adherence, depressive symptoms and health-related quality of life in young adults with cystic fibrosis.

SpringerPlus·2017
Same journal

Erratum to: Numerical method to compute acoustic scattering effect of a moving source.

SpringerPlus·2017
Same journal

Identifying appropriate protected areas for endangered fern species under climate change.

SpringerPlus·2017
Same journal

Predictive control strategy of a gas turbine for improvement of combined cycle power plant dynamic performance and efficiency.

SpringerPlus·2017
See all related articles

Related Experiment Video

Updated: Mar 2, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.6K

An Algorithm to detect balancing of iterated line sigraph.

Deepa Sinha1, Anshu Sethi2

  • 1South Asian University Akbar Bhawan, Chanakyapuri, New Delhi 110 021 India.

Springerplus
|May 19, 2017
PubMed
Summary
This summary is machine-generated.

This study introduces an algorithm for iterated signed line graphs (sigraphs), determining when they become balanced and their complexity. The research also proposes a network encryption technique using balanced sigraphs and adjacency matrices.

Keywords:
Balanced sigraphEncryption and decryptionIterated line sigraphLine sigraphNegative sectionNetworkSigraph

More Related Videos

Quantitative Static and Dynamic Assessment of Balance Control in Stroke Patients
09:17

Quantitative Static and Dynamic Assessment of Balance Control in Stroke Patients

Published on: May 17, 2020

3.9K
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

43.7K

Related Experiment Videos

Last Updated: Mar 2, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.6K
Quantitative Static and Dynamic Assessment of Balance Control in Stroke Patients
09:17

Quantitative Static and Dynamic Assessment of Balance Control in Stroke Patients

Published on: May 17, 2020

3.9K
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

43.7K

Area of Science:

  • Graph Theory
  • Discrete Mathematics
  • Network Security

Background:

  • Introduces signed graphs (sigraphs) where edges have assigned values (signs).
  • Defines the line sigraph (L(S)) as a sigraph where edges of the root sigraph become vertices.
  • Explains iterated signed line graphs (S_k) as a recursive construction of sigraphs.

Purpose of the Study:

  • To develop an algorithm for generating iterated line sigraphs.
  • To identify the conditions and values of 'k' for which iterated line sigraphs are balanced.
  • To determine the computational complexity of these operations.

Main Methods:

  • Development of a novel algorithm to compute iterated line sigraphs.
  • Analysis of graph properties to detect 'balanced' sigraphs for specific 'k' values.
  • Investigation of computational complexity associated with the algorithm.

Main Results:

  • An algorithm is presented for constructing iterated line sigraphs.
  • Criteria for determining when an iterated line sigraph becomes balanced are established.
  • The complexity of the proposed algorithm is analyzed.

Conclusions:

  • The study provides a method for generating and analyzing iterated line sigraphs.
  • A novel network encryption and decryption technique is proposed using balanced sigraphs and adjacency matrices.
  • This research contributes to graph theory and offers potential applications in secure data transmission.