Results 1 to 10 of about 4,075 (125)
Neutrosophic Circular-arc Graphs and Proper circular-arc Graphs [PDF]
Neutrosophic Sets and SystemsGraph theory is a fundamental branch of mathematics that studies networks made up of nodes (vertices) and connections (edges). A key concept in graph theory is the intersection graph, where vertices represent sets, and edges are drawn between vertices if
Florentin Smarandache, Takaaki Fujita
doaj +4 more sources
A Note on Longest Paths in Circular Arc Graphs
Discussiones Mathematicae Graph Theory, 2015 As observed by Rautenbach and Sereni [SIAM J. Discrete Math. 28 (2014) 335-341] there is a gap in the proof of the theorem of Balister et al. [Combin. Probab. Comput.
Joos Felix
doaj +2 more sources
Clique-Coloring Circular-Arc Graphs
Electronic Notes in Discrete Mathematics, 2009 Abstract A clique-coloring of a graph is a coloring of its vertices such that no maximal clique of size at least two is monochromatic. A circular-arc graph is the intersection graph of a family of arcs in a circle. We show that every circular-arc graph is 3-clique-colorable.
Marcia R Cerioli
exaly +2 more sources
The clique operator on circular-arc graphs
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Chih Lin +2 more
exaly +5 more sources
Graphs of low chordality [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. The odd (even) chordality is defined to be the length of the longest induced odd (even) cycle in it. Chordal graphs have chordality at most 3.
Sunil Chandran +2 more
doaj +3 more sources
On powers of circular arc graphs
CoRR, 2022 A class of graphs $\mathcal{C}$ is closed under powers if for every graph $G\in\mathcal{C}$ and every $k\in\mathbb{N}$, $G^k\in\mathcal{C}$. Also $\mathcal{C}$ is strongly closed under powers if for every $k\in\mathbb{N}$, if $G^k\in\mathcal{C}$, then $G^{k+1}\in\mathcal{C}$.
Ashok Kumar Das, Indrajit Paul
openaire +2 more sources
Boxicity of Circular Arc Graphs [PDF]
Graphs and Combinatorics, 2010 A $k$-dimensional box is the cartesian product $R_1 \times R_2 \times ... \times R_k$ where each $R_i$ is a closed interval on the real line. The {\it boxicity} of a graph $G$, denoted as $box(G)$, is the minimum integer $k$ such that $G$ can be represented as the intersection graph of a collection of $k$-dimensional boxes: that is two vertices are ...
Bhowmick, Diptendu, Chandran, Sunil L
openaire +3 more sources
Contact Graphs of Circular Arcs [PDF]
, 2015 We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most \(2s-k\) edges, and (2, k)-tight if in ...
Md. Jawaherul Alam +6 more
openaire +3 more sources
A High-Robust Automatic Reading Algorithm of Pointer Meters Based on Text Detection
Sensors, 2020 Automatic reading of pointer meters is of great significance for efficient measurement of industrial meters. However, existing algorithms are defective in the accuracy and robustness to illumination shooting angle when detecting various pointer meters ...
Zhu Li +4 more
doaj +1 more source
Drawing planar graphs with circular arcs [PDF]
Discrete & Computational Geometry, 1999 The authors study the problem of drawing planar graphs with circular arcs, while maintaining good angular resolution and small drawing area. They show the following: (1) There is an \(n\)-vertex planar graph requiring area exponential in \(n\) for any drawing using single-circle arcs for edges and having good angular resolution. (2) Let \(d(v)\) be the
C. C. Cheng +3 more
openaire +2 more sources