Results 1 to 10 of about 258,952 (290)
Traversability and connectivity of the middle graph of a graph [PDF]
Discrete Mathematics, 1976 AbstractWe define a graph M(G) as an intersection graph Ω(F) on the point set V(G) of any graph G. Let X(G) be the line set of G and F = V′(G) ∪ X(G), where V′(G) indicates the family of all one point subsets of the set V(G). Let M(G) = Ω(F). M(G) is called the middle graph of G. The following theorems result: 1.Theorem 1.
Takashi Hamada, Izumi Yoshimura
exaly +4 more sources
Electronic Journal of Graph Theory and Applications, 2015 We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones.
C. Dalfo, M. A. Fiol, M. Mitjana
doaj +8 more sources
The 2-Pebbling Property of the Middle Graph of Fan Graphs [PDF]
Journal of Applied Mathematics, 2014 A pebbling move on a graph G consists of taking two pebbles off one vertex and placing one pebble on an adjacent vertex. The pebbling number of a connected graph G, denoted by f(G), is the least n such that any distribution of n pebbles on G allows one ...
Yongsheng Ye, Fang Liu, Caixia Shi
doaj +6 more sources
Bartholdi zeta functions of line graphs and middle graphs of graph coverings [PDF]
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hirobumi Mizuno
exaly +3 more sources
Fair Fuzzy Matching in Middle Fuzzy Graph [PDF]
Ratio Mathematica, 2022 A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching.
S. Yahya Mohamed, S Suganthi
doaj +5 more sources
An algorithm to recognize a middle graph [PDF]
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 +3 more sources
Domination number of middle graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs,
Farshad Kazemnejad +3 more
doaj +4 more sources
Status Connectivity Indices of Middle graph [PDF]
Ratio MathematicaTopological index is sometimes also known as graph theoretic index, is a numerical invariant of a graph, the topological indices are classified on degree and distance based concepts.
Roopa Subhas Naikar
doaj +3 more sources
Total domination number of middle graphs
Electronic Journal of Graph Theory and Applications, 2022 A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set.
Farshad Kazemnejad +3 more
doaj +4 more sources
Middle School Students’ Graph Skills and Affective States about Graphs [PDF]
International Journal of Research in Education and Science, 2020 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 ...
Bursal, Murat, Yetiş, Serap
openaire +4 more sources