Results 11 to 20 of about 2,881 (227)
On coherent configuration of circular-arc graphs [PDF]
Communications in Combinatorics and OptimizationFor any graph, Weisfeiler and Leman assigned the smallest matrix algebra which contains the adjacency matrix of the graph. The coherent configuration underlying this algebra for a graph $\Gamma$ is called the coherent configuration of $\Gamma ...
Fatemeh Raei Barandagh +1 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
Fixed-Location Circular Arc Drawing of Planar Graphs
Journal of Graph Algorithms and Applications, 2007 In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in the plane. If for every edge we have only two possible circular arcs, then
Alon Efrat +2 more
doaj +1 more source
Pathwidth of Circular-Arc Graphs [PDF]
, 2007 The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time.
Karol Suchan, Ioan Todinca
openaire +1 more source
Power Domination in Circular-Arc Graphs [PDF]
Algorithmica, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chung-Shou Liao, D. T. Lee
openaire +1 more source
Journal of Graph Algorithms and Applications, 2015 Let G=(V,E) be a planar graph. An arrangement of circular arcs is called a composite arc-drawing of G, if its 1-skeleton is isomorphic to G. Similarly, a composite segment-drawing is described by an arrangement of straight-line segments.
André Schulz
doaj +1 more source
The Topological Connectivity of the Independence Complex of Circular-Arc Graphs
Universal Journal of Mathematics and Applications, 2019 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 the Cubicity of AT-Free Graphs and Circular-Arc Graphs [PDF]
, 2009 9 pages, 0 ...
L. Sunil Chandran +2 more
openaire +2 more sources
Drawing Graphs on Few Circles and Few Spheres
Journal of Graph Algorithms and Applications, 2019 Given a drawing of a graph, its visual complexity is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in 2D).
Myroslav Kryven +2 more
doaj +1 more source
Irredundancy in circular arc graphs
Discrete Applied Mathematics, 1993 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