Results 31 to 40 of about 8,504,362 (373)
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 Total H-Irregularity Strength of the Disjoint Union of Graphs
A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha+5 more
doaj +1 more source
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
On the K-theory of twisted higher-rank-graph C*-algebras [PDF]
We investigate the K-theory of twisted higher-rank-graph algebras by adapting parts of Elliott's computation of the K-theory of the rotation algebras.
Aidan Sims+24 more
core +3 more sources
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
Some topological indices of pentagonal double chains [PDF]
In graph theory, lattices are used when some structural part of the graph repeats itself finitely or infinitely many times. They have applications in complex analysis and geometry in mathematics, and also natural applications in chemical graph theory. As
Mahalank Pushpalatha+4 more
doaj +1 more source
Pattern vectors from algebraic graph theory [PDF]
Graphstructures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of ...
Bin Luo+3 more
core +4 more sources
Extremal graph theory and finite forcibility [PDF]
We study the uniqueness of optimal solutions to extremal graph theory problems. Our main result is a counterexample to the following conjecture of Lov´asz, which is often referred to as saying that “every extremal graph theory problem has a finitely ...
Grzesik, Andrzej+2 more
core +1 more source
Spectral graph theory : from practice to theory [PDF]
Graph theory is the area of mathematics that studies networks, or graphs. It arose from the need to analyse many diverse network-like structures like road networks, molecules, the Internet, social networks and electrical networks.
Farrugia, Alexander
core
Limit theory for the Gilbert graph [PDF]
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random geometric graph,
Reitzner, Matthias+2 more
core +2 more sources