Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 88 for “"line graph"”.
-
Optimising line graph aspect ratio
… was to find a way of selecting aspect ratios for line graphs so that they would provide the data analyst using graphical methods with the most information with the least distortion. If an ideal aspect ratio could be discovered it would help scientist make the best possible use of their research …
-
Edge embedding with line graph enhancement
… entities can be represented and analyzed through graphs. These include diverse types such as social, information, and technical networks. However, the complex topologies of these networks present challenges in converting graph data into machine-readable vector formats. Existing models such as …
-
Children’s concepts about the slope of a line graph
… with how children interpret the slope of a line graph. Today with the vast accumulations of data which are available from computers, people are being faced with an ever increasing amount of pictorial representation of this data. Therefore it is of the utmost importance that children …
-
Levels Of Line Graph Question Interpretation With Intermediate Elementary Students Of Varying Scientific And Mathematical Knowle
… knowledge affected their interpretation of line graphs and how their interpretations were affected by graph question levels. A purposive sample of 14 6th-grade students engaged in think aloud interviews (Ericsson & Simon, 1993) while completing an excerpted Test of Graphing in Science (TOGS) …
-
An experimental sequence examining the effect of task type, memory condition, and display presentation type on performance time and error rate, using columnar table versus vertical bar graph versus line graph
… in three experiments that compared Tables, Line graphs and Bar graphs forms of data presentation. The experiments were performed each consisting of a training task followed by answering some questions based on the presented material. The experimental series were presented to six groups. …
-
Claw -free graphs and line graphs
… conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Tutte that every 4-edge-connected graph has a no-where-zero 3-flow. Towards the hamiltonian line graph problem, we proved that every 3-connected N2-locally connected claw-free graph is hamiltonian, …
-
Group Colorability and Hamiltonian Properties of Graphs
… conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Matthews and Sumner that every 4-connected claw-free graph is hamiltonian. Towards the hamiltonian line graph problem, we proved that every 3-edge-connected, essentially 4-edge-connected graph G has …
-
Graph Neural Networks: A Feature and Structure Learning Approach
… in learning from more generic data such as graphs. In convolutional neural networks (CNNs), for example, the trainable local filters enable the automatic extraction of high-level features. The computation with filters requires a fixed number of ordered units in the receptive fields. However, …
-
Variations on a Theme: Graph Homomorphisms
… thesis investigates three areas of the theory of graph homomorphisms: cores of graphs, the homomorphism order, and quantum homomorphisms. A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that, for vertex transitive graphs, the size of …
-
Hamiltonian line graphs and claw -free graphs
… conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Matthews and Sumner that every 4-connected claw-free graph is hamiltonian. Towards the hamiltonian line graph problem, we proved that every 3-connected claw-free Z8-free graph is hamiltonian, where …
-
Algorithms for Drawing Graphs and Polylines with Straight-Line Segments
Graphs provide a key means to model relationships between entities. They consist of vertices representing the entities, and edges representing relationships between pairs of entities. To make people conceive the structure of a graph, it is almost inevitable to visualize the graph. We call such a …
-
Circuits and Cycles in Graphs and Matroids
… focuses on characterizing cycles and circuits in graphs, line graphs and matroids. We obtain the following advances. 1. Results in graphs and line graphs. For a connected graph G not isomorphic to a path, a cycle or a K1,3, let pc(G) denote the smallest integer n such that the nth iterated line …
-
An Evaluation of Road Network Structure as a Predictor of Traffic Volume
… evaluates the relationships between various graph theory metrics and taxi traffic volume for the cities of San Francisco, California and Porto, Portugal. We also evaluate a modified betweenness centrality metric which incorporates the count of distinct origin-destination pairs from the taxi …
-
Are all pictures worth 1,000 words? An Investigation of Fit Between Graph Type and Performance on Accounting Data Analytics Tasks
… provided suggestions of when to use a specific graph type, there is no empirical evidence regarding the relation between the use of specific graph types and analytical performance. An analysis of Fortune 100 annual reports revealed that a variety of different graph types are used to display …
-
Data visualization and interaction on smartwatch small screens
… optimization of a small display while presenting graphic data such as line charts. Due to the small screen of smartwatches presenting the data could be challenging. To overcome these challenges, I will propose two techniques, Compression and Simplification, to improve the visualization techniques …
-
Correspondence Colouring and its Applications to List Colouring and Delay Colouring
… a result by Georgakopoulos, stating that cubic graphs are 4-delay colourable. We show that delay colouring can be formulated as an instance of correspondence colouring. Then we show that the modified line graph of a cubic bipartite graph is generally 4-correspondence colourable, using a Brooks’ …
-
On Eulerian subgraphs and hamiltonian line graphs
A graph {\color{black}$G$} is Hamilton-connected if for any pair of distinct vertices {\color{black}$u, v \in V(G)$}, {\color{black}$G$} has a spanning $(u,v)$-path; {\color{black}$G$} is 1-hamiltonian if for any vertex subset $S \subseteq {\color{black}V(G)}$ with $|S| \le 1$, $G - S$ has a …
-
Group Connectivity of Graphs
… of nowhere-zero flows and showed that a plane graph G has a face k-coloring if and only if G has a nowhere-zero A-flow, for any Abelian group A with |A| ≥ k. In 1992 Jaeger et al. [16] extended nowhere-zero flows to group connectivity of graphs: given an orientation D of a graph G, if for any …
-
Mule Deer Habitat Modeling With the Use of Existing Government Data
The use of Geographic Information Systems (GIS) can be used as a helpful tool for wildlife biologists. GIS can be used to analyze wildlife habitat. The purpose of this research was to use existing government data: Gap Analysis Project (GAP) data, Digital Elevation Model (DEM) data and Digital Line …
-
Assessing the relationship between CEO remuneration and organisational performance in a water board in South Africa
… components for each year and then displayed on a line graph to display the movements year on year. Histograms were also used to depict both the performance levels of the water board and the remuneration components individually year on year. A line graph was then used to portray the relationship …
Page 1 of 5