Results 21 to 30 of about 972,352 (283)
A short proof of the middle levels theorem [PDF]
Consider the graph that has as vertices all bitstrings of length $2n+1$ with exactly $n$ or $n+1$ entries equal to 1, and an edge between any two bitstrings that differ in exactly one bit.
Gregor, Petr +2 more
core +2 more sources
Relationship between chlorophyll-a, sea surface temperature, and sea surface salinity [PDF]
BACKGROUND AND OBJECTIVES: This study aimed to investigate the long-term relationship between chlorophyll-a, sea surface temperature, and sea surface salinity monthly from January 2015 to December 2021.
M. Hidayat +4 more
doaj +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
Proof of the middle levels conjecture [PDF]
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ in exactly one ...
Mutze, Torsten
core +1 more source
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families.
Patil H.P., Pandiya Raj R.
doaj +1 more source
Middle School Students’ Graph Skills and Affective States about Graphs [PDF]
This survey design study was designed to test whether the graph skills and affective states of middle school students about graphs differ by their gender, grade level, and graph types (line, bar, and pie). The data collection instruments consisted of two scales developed by the authors and a Graph Skills Test, which consisted of graph questions from ...
Murat Bursal, Serap Yetiş
openaire +1 more source
Compiler Optimization: A Case for the Transformation Tool Contest [PDF]
An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of ...
Sebastian Buchwald, Edgar Jakumeit
doaj +1 more source
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
EEG Resting-State Brain Topological Reorganization as a Function of Age [PDF]
Resting state connectivity has been increasingly studied to investigate the effects of aging on the brain. A reduced organization in the communication between brain areas was demonstrated b y combining a variety of different imaging technologies (fMRI,
Astolfi, Laura +5 more
core +4 more sources
Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.
Forouhandeh S.F. +4 more
doaj +1 more source

