Pedro Díaz Navarro
Abstract
Open-access reader
In this paper we define two infinite families of graphs called C-δ graphs and -graphs and prove that δ-graphs satisfy delta conjecture. Also we see that C-δ graphs family contains the complements of δ-graphs. Finally we give a list of C-δ graphs and the relationship with the minimum semidefinite rank of these graphs.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we define two infinite families of graphs called C-δ graphs and -graphs and prove that δ-graphs satisfy delta conjecture. Also we see that C-δ graphs family contains the complements of δ-graphs. Finally we give a list of C-δ graphs and the relationship with the minimum semidefinite rank of these graphs.
Key concepts: Combinatorics, Indifference graph, Clique-sum, Trapezoid graph, Chordal graph, Mathematics, Cograph, Metric dimension