In this paper we present Paged Graph Visualization (PGV), a new user-centered, semi-autonomous visualization tool for RDF data exploration, validation and examination. PGV consists of two main components: the PGV visualizer, which is the front-end of PGV, and the BRAHMS data-store, which is our high performance main-memory RDF storage system. Unlike the existing graph visualization techniques w...

A ladder is a 2 × k grid graph. When does graph class $${\cal C}$$ exclude some as minor? We show that this the case if and only all graphs G in admit proper vertex coloring with bounded number of colors such for every 2-connected subgraph H G, there color appears exactly once H. This type relaxation notion centered coloring, where connected must be The minimum treedepth it known classes are th...

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in plane. Specifically, consider all straight-line a set 2n points that are placed equidistantly unit circle. A operation such matching replaces two edges span an empty quadrilateral with other quadrilateral, and is called centered if contains center The graph Gn has those as vertices, edge between any d...

We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of clusters periodically using a graph partitioning algorithm called Fixed Centered Partitioning first. Each cluster is represented by a coordinator node on the ring which implements various distributed mutual exclusion al...

When people explore and manage information, they think in terms of topics and themes. However, the software that supports information exploration sees text at only the surface level. In this paper we show how topic modeling – a technique for identifying latent themes across large collections of documents – can support semantic exploration. We present TopicViz, an interactive environment for inf...

Consider a connected undirected graph G = (V, E), a subset of vertices C ⊆ V , and an integer r ≥ 1; for any vertex v ∈ V , let Br (v) denote the ball of radius r centered at v, i.e., the set of all vertices within distance r from v. If for all vertices v ∈ V (respectively, v ∈ V \C), the sets Br (v) ∩ C are all nonempty and different, then we call C an r -identifying code (respectively, an r -...

it is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (castelnuovo-mumford) regularity. as a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph g are equal provided g is well-covered bipa...

‎let $s$ be a subset of a finite group $g$‎. ‎the bi-cayley graph ${rm bcay}(g,s)$ of $g$ with respect to $s$ is an undirected graph with vertex set $gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid xin g‎, ‎ sin s}$‎. ‎a bi-cayley graph ${rm bcay}(g,s)$ is called a bci-graph if for any bi-cayley graph ${rm bcay}(g,t)$‎, ‎whenever ${rm bcay}(g,s)cong {rm bcay}(g,t)$ we have $t=gs^alpha$ for some $...

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...