Results 31 to 40 of about 6,789,089 (246)
Solutions of Detour Distance Graph Equations
Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs.
S. Celine Prabha+7 more
doaj +1 more source
Background: Analysis of the human connectome using functional magnetic resonance imaging (fMRI) started in the mid-1990s and attracted increasing attention in attempts to discover the neural underpinnings of human cognition and neurological disorders. In
F. Farahani+2 more
semanticscholar +1 more source
Generalized inverses in graph theory
–In this article, some interesting applications of generalized inverses in the graph theory are revisited. Interesting properties of generalized inverses are employed to make the proof of several known results simpler, and several techniques such as ...
Umashankara Kelathaya+2 more
doaj +1 more source
On the Beta-Number of Forests with Isomorphic Components
The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio+3 more
doaj +1 more source
Expanding Horizons: Graph Theory’s Multifaceted Applications [PDF]
A subfield of mathematics called graph theory studies networks of points interconnected by lines. Researchers may model and examine the structure of a network using graph theory.
Saxena Abhishek+6 more
doaj +1 more source
Comparative Study of Prism Octahedron Network via Eccentric Invariants
Topological indices are empirical features of graphs that characterize the topology of the graph and, for the most part, are graph independent. An important branch of graph theory is chemical graph theory.
Haidar Ali+5 more
doaj +1 more source
Graph theory methods: applications in brain networks
Network neuroscience is a thriving and rapidly expanding field. Empirical data on brain networks, from molecular to behavioral scales, are ever increasing in size and complexity.
O. Sporns
semanticscholar +1 more source
AbstractA unified approach to a variety of graph-theoretic problems is introduced. The k-closure Ck(G) of a simple graph G of order n is the graph obtained from G by recursively joining pairs of nonadjacent vertices with degree-sum at least k. It is shown that, for many properties P, one can find a suitable value of k (depending on P and n) such that ...
J. A. Bondy, Vašek Chvátal
openaire +3 more sources
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi+3 more
doaj +1 more source
Interval Valued Pentapartitioned Neutrosophic Graphs with an Application to MCDM
The concept of interval valued pentapartitioned neutrosophic set is the extension of interval-valued neutrosophic set, quadripartitioned neutrosophic set, interval valued quadripartitioned neutrosophic set and pentapartitioned neutrosophic set.
Said Broumi+7 more
doaj +1 more source