Representaciones Circulares de Grafos Simples Conexos y el Rango M\'inimo Semidefinido de un Delta Grafo

TL;DR

This paper introduces a technique for representing simple connected graphs using Clockwise Circular Representations and demonstrates its application in calculating orthogonal representations crucial for matrix analysis and graph theory.

Contribution

The paper presents a novel method for circular graph representations and applies it to determine the minimum semidefinite rank of delta graphs.

Findings

Effective representation of connected graphs using circular methods

Application to compute orthogonal representations

Insights into the minimum semidefinite rank of delta graphs

Abstract

In this paper we give a technique to represent simple connected graphs by using Clockwise Circular Representations and we show its applications by calculating orthogonal representations of simple connected graphs which are essentials in matrix analysis and graph theory.