Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Ogive Graph

Ogive Graph

An ogive graph is sometimes called a cumulative frequency polygon. It is one type of frequency polygon that shows cumulative frequency. In other words, the cumulative percentages are added to the graph from left to right. An ogive graph plots cumulative frequency on the vertical y-axis and class boundaries along the horizontal x-axis. It’s very similar to a histogram; only instead of rectangles, an ogive displays a single point where the top right of the rectangle would be. Creating this...

Vector Algebra: Graphical Method

Vector Algebra: Graphical Method

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...

Stability of structures

Stability of structures

In mechanical engineering, the stability of systems under various forces is critical for designing durable and efficient structures. One fundamental way to explore these concepts is by analyzing systems like two rods connected at a pivot point, O, with a torsional spring of spring constant k at the pivot point. This system is similar in appearance to a scissor jack used to change tires on a car. In this case, the arms of the linkage (equivalent to the rods in this system) are entirely vertical,...

Graphing the Wave Function

Graphing the Wave Function

Consider the wave equation for a sinusoidal wave moving in the positive x-direction. The wave equation is a function of both position and time. From the wave equation, two different graphs can be plotted.

Elevation of Intermediate Points on Vertical Curves

Elevation of Intermediate Points on Vertical Curves

Vertical curves are essential in roadway design because they provide smooth transitions between varying roadway grades. Designing vertical curves involves calculating intermediate elevations and identifying the curve's highest or lowest point, which is essential for optimal roadway performance.Intermediate elevations on a vertical curve are determined using the tangent offset method. This method considers the initial elevation at the start of the curve, the grades, and the curve's geometry. The...

pV-Diagrams

pV-Diagrams

The pV diagram, which is a graph of pressure versus volume of the gas under study, is helpful in describing certain aspects of the substance. When the substance behaves like an ideal gas, the ideal gas equation describes the relationship between its pressure and volume. On a pV diagram, it is common to plot an isotherm, which is a curve showing p as a function of V with the number of molecules and the temperature fixed. Then, for an ideal gas, the product of the pressure of the gas and its...

You might also read

Related Articles

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

Sort by

Same author

A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum.

Discrete mathematics and theoretical computer science·2019

Same author

Fast Sequential Creation of Random Realizations of Degree Sequences.

Internet mathematics·2016

Same author

Threshold Digraphs.

Journal of research of the National Institute of Standards and Technology·2015

Same journal

Precise Numerical Differentiation of Thermodynamic Functions with Multicomplex Variables.

Journal of research of the National Institute of Standards and Technology·2024

Same journal

Characterization of 3-Dimensional Printing and Casting Materials for use in Computed Tomography and X-ray Imaging Phantoms.

Journal of research of the National Institute of Standards and Technology·2024

Same journal

On The Quotient of a Centralized and a Non-centralized Complex Gaussian Random Variable.

Journal of research of the National Institute of Standards and Technology·2024

Same journal

Fast Methods for Finding Multiple Effective Influencers in Real Networks.

Journal of research of the National Institute of Standards and Technology·2024

Same journal

Disinfection of Respirators with Ultraviolet Radiation.

Journal of research of the National Institute of Standards and Technology·2024

Same journal

DNA Origami Design: A How-To Tutorial.

Journal of research of the National Institute of Standards and Technology·2024

See all related articles

Search research articles

Related Experiment Video

Updated: Oct 10, 2025

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

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

Published on: December 7, 2021

Forced Edges and Graph Structure.

Brian Cloteaux¹

¹National Institute of Standards and Technology, Gaithersburg, MD 20899, USA.

Journal of Research of the National Institute of Standards and Technology

|December 8, 2021

Summary

This summary is machine-generated.

Researchers studied forced and forbidden edges in graph degree sequences. Graphs with these specific edges have limited diameters and are maximally edge-connected, revealing key structural properties.

Keywords:

degree sequence forced edge graph structure

More Related Videos

High Resolution Quantitative Synaptic Proteome Profiling of Mouse Brain Regions After Auditory Discrimination Learning

High Resolution Quantitative Synaptic Proteome Profiling of Mouse Brain Regions After Auditory Discrimination Learning

Published on: December 15, 2016

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

Related Experiment Videos

Last Updated: Oct 10, 2025

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

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

Published on: December 7, 2021

High Resolution Quantitative Synaptic Proteome Profiling of Mouse Brain Regions After Auditory Discrimination Learning

High Resolution Quantitative Synaptic Proteome Profiling of Mouse Brain Regions After Auditory Discrimination Learning

Published on: December 15, 2016

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

Area of Science:

Graph Theory
Combinatorics
Discrete Mathematics

Background:

Understanding graph structures is crucial in various scientific fields.
Degree sequences define fundamental properties of graphs.
Identifying specific edge patterns within graph realizations is an ongoing area of research.

Purpose of the Study:

To define and analyze "forced" and "forbidden" edges within graph degree sequences.
To investigate the structural properties of graphs containing these specific edge sets.
To establish relationships between the sizes of forced and forbidden edge sets and their impact on graph realizations.

Main Methods:

Definition of forced edges (present in all labeled realizations).
Definition of forbidden edges (present in no labeled realizations).
Structural analysis of graphs based on the presence of forced or forbidden edges.

Main Results:

Characterization of the structure of forced and forbidden edge sets.
Determination of the relationship between the sizes of these sets.
Demonstration that realizations of degree sequences with forced/forbidden edges have a diameter of at most 3.
Proof that these graphs are maximally edge-connected.

Conclusions:

The presence of forced or forbidden edges imposes significant structural constraints on graph realizations.
These constraints lead to specific diameter bounds and high edge-connectivity.
The study provides a deeper understanding of the relationship between degree sequences and graph structures.