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

Graphical Representation of Inequalities

Graphical Representation of Inequalities

The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all...

Graphs of Equations in Two Variables

Graphs of Equations in Two Variables

An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...

Graphs of Functions

Graphs of Functions

Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...

Graphs of Polar Equations

Graphs of Polar Equations

The polar coordinate system represents points using a distance from a central point (the pole) and an angle from a reference direction (the polar axis). Unlike rectangular coordinates, polar coordinates are ideal for graphing curves with radial symmetry or periodic behavior.Some general forms of graphs in polar coordinates include the following:Equation of a Circle (Centered at the Pole):A graph where the radius remains constant for all angles traces a circle centered at the pole:Equation of a...

Incomplete Dominance

Incomplete Dominance

Gregor Mendel's work (1822 - 1884) was primarily focused on pea plants. Through his initial experiments, he determined that every gene in a diploid cell has two variants called alleles inherited from each parent. He suggested that amongst these two alleles, one allele is dominant in character and the other recessive. The combination of alleles determines the phenotype of a gene in an organism.

Lattice Centering and Coordination Number

Lattice Centering and Coordination Number

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

You might also read

Related Articles

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

Sort by

Same author

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.

Central European journal of operations research·2018

Same journal

Sum Index, Difference Index and Exclusive Sum Number of Graphs.

Graphs and combinatorics·2026

Same journal

Note on extremal problems about connected subgraph sums.

Graphs and combinatorics·2026

Same journal

On Flipping Edge Sets in Unique Sink Orientations.

Graphs and combinatorics·2025

Same journal

Note on Polychromatic Coloring of Hereditary Hypergraph Families.

Graphs and combinatorics·2024

Same journal

Perfect <i>k</i>-Colored Matchings and <math><mrow><mo>(</mo> <mi>k</mi> <mo>+</mo> <mn>2</mn> <mo>)</mo></mrow></math> -Gonal Tilings.

Graphs and combinatorics·2020

See all related articles

Search research articles

Related Experiment Video

Updated: Jan 5, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Disjoint Paired-Dominating sets in Cubic Graphs.

Gábor Bacsó¹, Csilla Bujtás^2,3, Casey Tompkins^4,5

¹1Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary.

Graphs and Combinatorics

|October 22, 2019

Summary

This summary is machine-generated.

The vertex set of claw-free cubic graphs can be divided into two paired-dominating sets. This finding advances graph theory research on dominating sets and perfect matchings.

Keywords:

Claw-free graph Cubic graph Dominating set Paired-dominating set Total dominating set

More Related Videos

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Published on: July 24, 2021

The HoneyComb Paradigm for Research on Collective Human Behavior

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

Related Experiment Videos

Last Updated: Jan 5, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Quadruple-Checkerboard: A Modification of the Three-Dimensional Checkerboard for Studying Drug Combinations

Published on: July 24, 2021

The HoneyComb Paradigm for Research on Collective Human Behavior

The HoneyComb Paradigm for Research on Collective Human Behavior

Published on: January 19, 2019

Area of Science:

Graph Theory
Combinatorics
Discrete Mathematics

Background:

Dominating sets are fundamental in graph theory, with applications in network design and coding theory.
Paired-dominating sets introduce a structural constraint, requiring the dominating set itself to possess a perfect matching.
Cubic graphs, where each vertex has degree three, and claw-free graphs, which lack a specific subgraph structure, are important classes in graph theory.

Purpose of the Study:

To investigate the existence and properties of paired-dominating sets in specific graph classes.
To prove that the vertex set of any claw-free cubic graph can be partitioned into exactly two paired-dominating sets.

Main Methods:

The study utilizes structural graph theory techniques.
Proof involves demonstrating the partition property for the specified graph class.

Main Results:

A key result is the proof that every claw-free cubic graph admits a partition of its vertex set into two paired-dominating sets.
This establishes a strong structural property for this graph class.

Conclusions:

The findings contribute to the understanding of dominating set theory, particularly concerning paired-dominating sets.
The result highlights a specific structural characteristic of claw-free cubic graphs, potentially opening avenues for further research in graph decomposition and algorithmic applications.