Results 1 to 10 of about 2,770 (122)
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
Balancedness of subclasses of circular-arc graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Flavia Bonomo +3 more
doaj +5 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
On the hyperbolicity constant of circular-arc graphs [PDF]
Discrete Applied Mathematics, 2019 arXiv admin note: text overlap with arXiv:1501.02288 by other ...
Rosalio Reyes +2 more
exaly +3 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
On cliques of Helly Circular-arc Graphs
Electronic Notes in Discrete Mathematics, 2008 Abstract A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of arcs that traverse some clique point on the circle. A clique model is a Helly model that identifies one clique point for each maximal clique.
Min Chih Lin +2 more
exaly +2 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