Results 21 to 30 of about 4,192 (230)
Irredundancy in circular arc graphs
An open neighbourhood of a vertex \(x\) in an undirected graph \(G\) is the set \(N(x)\) of all vertices adjacent to \(x\) in \(G\); its closed neighbourhood is \(N[x]=N(x) \cup \{x\}\). For a set \(S\) of vertices set \(N(S)=\bigcup_{x \in S}N(x)\) and \(N[S]=\bigcup_{x \in S} N[x]\). A subset \(X\) of the vertex set of \(G\) is called irredundant (or
Martin Charles Golumbic, Renu C. Laskar
openaire +2 more sources
Description of shape patterns using circular arcs for object detection
The authors propose a novel object detection algorithm based on shape matching using a single sketch of an object. The proposed algorithm uses circular arc segments to describe image edges; this approach is advantageous for shape description, shape ...
Wonil Chang, Soo‐Young Lee
doaj +1 more source
Partial Characterizations of Circular-Arc Graphs
AbstractA circular‐arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular‐arc graphs by a list of minimal forbidden induced subgraphs when the graph belongs to ...
Flavia Bonomo +3 more
openaire +5 more sources
Lombardi drawings of knots and links
Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into $\mathbb{R}^2$, such that no more than two points project to the same point in $\mathbb{R}^2$.
Philipp Kindermann +5 more
doaj +1 more source
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haim Kaplan, Yahav Nussbaum
openaire +2 more sources
The Topological Connectivity of the Independence Complex of Circular-Arc Graphs
Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj +1 more source
On powers of circular arc graphs and proper circular arc graphs
Let \(\mathcal K\) denote the class of circular arc graphs. The author gives a new proof that if a graph \(G\in {\mathcal K}\), then the power \(G^n\in {\mathcal K}\) for any positive integer \(n\). Moreover, he proves that if \(G^n\in {\mathcal K}\) then \(G^{n+2}\in {\mathcal K}\) and if \(\text{diam}(G^n)\geq 4\) then \(G^n\in {\mathcal K}\) implies
openaire +2 more sources
Balancedness of subclasses of circular-arc graphs [PDF]
Graph Theory A graph is balanced if its clique-vertex incidence matrix contains no square submatrix of odd order with exactly two ones per row and per column. There is a characterization of balanced graphs by forbidden induced subgraphs, but no characterization by mininal forbidden induced subgraphs is known, not even for the case of circular-
Flavia Bonomo +3 more
openaire +5 more sources
On the hyperbolicity constant of circular-arc graphs [PDF]
arXiv admin note: text overlap with arXiv:1501.02288 by other ...
Rosalío Reyes +3 more
openaire +2 more sources
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source

