Results 21 to 30 of about 2,686,069 (331)
Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality.
Holleis, Paul +2 more
openaire +1 more source
Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs
Let G be a simple finite and connected graph with the vertex set V(G) and the edge set X(G). Let V'(G) be the family of all one-point subsets of V(G). Both the line graph L(G) of G and the total graph T(G) of G are standard graph theoretical concepts. The middle graph M(G) of G is the intersection graph of \(V'(G)\cup X(G)\) and the quasi-total graph P(
Sastry, D.V.S, Raju, B.Syam Prasad
openaire +2 more sources
Graph saturation in multipartite graphs [PDF]
16 pages, 4 ...
Ferrara, Michael +3 more
openaire +2 more sources
For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
B. Basavanagoud, Veena Mathad
openaire +2 more sources
Planar Graphs as VPG-Graphs [PDF]
Summary: A graph is \(B_k\)-VPG when it has an intersection representation by paths in a rectangular grid with at most \(k\) bends (turns). It is known that all planar graphs are \(B_3\)-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are \(B_2\)-VPG.
Chaplick, Steven, Ueckerdt, Torsten
openaire +3 more sources
In architectural and construction system “Monofant” a self-supporting skeleton consisting of a spatial curvilinear framework and unrecoverable hollow-core inserts made of expanded polystyrene was used to erect buildings and structures of curved shapes ...
Bugayevskiy Sergey +3 more
doaj +1 more source
Graph Powers and Graph Homomorphisms [PDF]
In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Hajiabolhassan, Hossein, Taherkhani, Ali
openaire +3 more sources
The Role of Visual Scaffolding in Enhancing Iranian EFL Students’ Writing Ability [PDF]
To better illuminate the link between scaffolding and visual aids, this quasi-experimental study attempted to scaffold an intact group of 14 intermediate-level Iranian English as a foreign language (EFL) learners through providing graphs with the aim of ...
Mahnaz Mostafaei Alaei +2 more
doaj +1 more source
Explanations in recommender systems are a requirement to improve users’ trust and experience. Traditionally, explanations in recommender systems are derived from their internal data regarding ratings, item features, and user profiles.
Marta Caro-Martínez +2 more
doaj +1 more source

