Results 31 to 40 of about 2,773,301 (295)
Graph Theory for the Middle School. [PDF]
, 2006 After being introduced to graph theory and realizing how it can be utilized to solve real-world problems, the author decided to create modules of study on graph theory appropriate for middle school students. In this thesis, four modules were developed in
Robinson, Laura Ann
core +1 more source
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
An algorithm to recognize a middle graph
Discrete Applied Mathematics, 1984 AbstractA graph F is called middle if there exists a graph G such that there is a one-to-one correspondence between the vertices of F and the vertices and edges of G such that two vertices of F are adjacent if and only if the corresponding elements (considered as subsets of the set of vertices) have a non-empty intersection.In this paper we present a ...
Miroslawa Skowronska, Maciej M. Syslo
openaire +2 more sources
Discussiones Mathematicae Graph Theory, 2015 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
Journal of Educational Research in Mathematics, 2020 In this study, in order to explore ways that statistical graphs teaching in elementary mathematics education can be improved, first, the types of statistical graphs that appear in middle school social textbooks were examined, and second, the ...
Byungjoo Tak, Eun-Sung Ko
doaj +1 more source
On Domatic Number of Some Rotationally Symmetric Graphs
Journal of Mathematics, 2023 Domination is a well-known graph theoretic concept due to its significant real-world applications in several domains, such as design and communication network analysis, coding theory, and optimization.
Hassan Raza +2 more
doaj +1 more source
A numeral system for the middle-levels graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2021 The middle-levels graph $M_k ...
openaire +5 more sources
On Strong Split Middle Domination of a Graph [PDF]
, 2016 The middle graph M(G) of graph G is obtained by inserting a vertex xi in the “middle” of each edge ei, 1 ? i ? |E(G)|, and adding the edge xixj for 1?i ? j ? |E(G)| if and only if ei and ej have a common vertex.
, Dr. M.H. Muddebihal, Megha Khandelwal
core +1 more source
On k-rainbow domination in middle graphs [PDF]
RAIRO - Operations Research, 2021 Let G be a finite simple graph with vertex set V(G) and edge set E(G). A function f : V(G) → P({1,2,…,k}) is a k-rainbow dominating function on G if for each vertex v∈V(G) for which f(v) = ∅, it holds that ⋃u∈N(v) f(u) = {1,2,…,k}. The weight of a k-rainbow dominating function is the value ∑v∈V(G)|f(v)|.
openaire +3 more sources
Frontiers in Aging Neuroscience, 2020 Mild cognitive impairment (MCI) is often considered a critical time window for predicting early conversion to Alzheimer’s disease (AD). Brain functional connectome data (i.e., functional connections, global and nodal graph metrics) based on resting-state
Xiaowen Xu +13 more
doaj +1 more source