Results 1 to 10 of about 972,233 (164)
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 +9 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
Perfect Roman domination in middle graphs [PDF]
Discrete Mathematics Letters, 2021 The middle graph $M(G)$ of a graph $G$ is the graph obtained by subdividing each edge of $G$ exactly once and joining all these newly introduced vertices of adjacent edges of $G$. A perfect Roman dominating function on a graph $G$ is a function $f : V(G) \rightarrow \{0, 1, 2\}$ satisfying the condition that every vertex $v$ with $f(v)=0$ is adjacent ...
Kijung Kim
doaj +4 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 +4 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
Weak embeddings of posets to the Boolean lattice [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs and of Patkos.
Dömötör Pálvölgyi
doaj +6 more sources
Status Connectivity Indices of Middle graph
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 +2 more sources
Oscillation-specific nodal alterations in early to middle stages Parkinson’s disease [PDF]
Translational Neurodegeneration, 2019 Background Different oscillations of brain networks could carry different dimensions of brain integration. We aimed to investigate oscillation-specific nodal alterations in patients with Parkinson’s disease (PD) across early stage to middle stage by ...
Xiaojun Guan +14 more
doaj +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 +2 more sources
On the D-differential of a graph
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S.
Kijung Kim
doaj +1 more source