Results 11 to 20 of about 2,773,301 (295)
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 +2 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 +6 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 +5 more sources
Graph Equations for Line Graphs, Jump Graphs, Middle Graphs, Splitting Graphs And Line Splitting Graphs [PDF]
Mapana - Journal of Sciences, 2010 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 +3 more sources
Vulnerability: integrity of a middle graph
, 2008 A communication network can be considered to be highly vulnerable to disruption if the destruction of a few elements can result in no member's being able to communicate with very many others. This idea suggests the concept of the integrity of a graph.
Aysun Ataç, Şebnem Çelik
openaire +4 more sources
The Cognitive Connectome in Healthy Aging
Frontiers in Aging Neuroscience, 2021 Objectives: Cognitive aging has been extensively investigated using both univariate and multivariate analyses. Sophisticated multivariate approaches such as graph theory could potentially capture unknown complex associations between multiple cognitive ...
Eloy Garcia-Cabello +12 more
doaj +1 more source
Line Graphs and Middle Graphs that are Divisor Graphs
WSEAS TRANSACTIONS ON MATHEMATICS, 2020 In this paper it is determined when the line graphs and the middle graphs of some classes of graphs are divisor graphs. Complete characterizations for cycles, trees, complete graphs and complete multipartite graphs whose line graphs (middle graphs) are divisor graphs are obtained. It is also shown that the line graphs and the middle graphs of the cycle
Salah Al-Addasi +2 more
openaire +1 more source
Split Domination Number in Edge Semi-Middle Graph
Pan-American Journal of Mathematics, 2022 Let G = (p, q) be a connected graph and Me(G) be its corresponding edge semi-middle graph. A dominating set D ⊆ V [Me(G)] is split dominating set V [Me(G)] – D is disconnected.
Venkanagouda M. Goudar +2 more
doaj +1 more source
Applied Network Science, 2023 Hypergraph is a graph structure that can efficiently express the relationship of multiple nodes and has attracted attention in recent years. As with normal graphs, the structure changes every moment, and it is an important research topic in graph mining ...
Shuta Ito, Takayasu Fushimi
doaj +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
, 2010 Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source