Results 21 to 30 of about 6,789,089 (246)

On the beta-number of linear forests with an even number of components

open access: yesAKCE International Journal of Graphs and Combinatorics, 2018
The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is , otherwise.
Rikio Ichishima, Akito Oshima
doaj   +2 more sources

On the strength of some trees

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let be a graph of order . A numbering of is a labeling that assigns distinct elements of the set to the vertices of , where each edge of is labeled .
Rikio Ichishima   +2 more
doaj   +1 more source

A Guide to Conquer the Biological Network Era Using Graph Theory

open access: yesFrontiers in Bioengineering and Biotechnology, 2020
Networks are one of the most common ways to represent biological systems as complex sets of binary interactions or relations between different bioentities.
Mikaela Koutrouli   +3 more
semanticscholar   +1 more source

Introduction to graph theory

open access: yesMathematical Gazette, 1973
In graph theory, the term graph refers to a set of vertices and a set of edges. A vertex can be used to represent any object. Graphs may contain undirected or directed edges. An undirected edge is a set of two vertices. A directed edge is an ordered pair
K. Fraughnaugh
semanticscholar   +1 more source

Confluence theory for graphs [PDF]

open access: yesAlgebraic & Geometric Topology, 2007
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of graphs (via Kuperberg's spiders ...
Sikora, Adam, Westbury, Bruce
openaire   +5 more sources

Revisiting the paper on “Applications of graph theory to enzyme kinetics and protein folding kinetics: steady and non-steady state systems”

open access: yesBiotechnology and Bioprocessing, 2020
About 30 years ago a very important paper on “Applications of graph theory to enzyme kinetics and protein folding kinetics: steady and non-steady state systems”
K. Chou
semanticscholar   +1 more source

The Determinant of Matching Matrix in the Evaluation of Matching Polynomial

open access: yesRevista de Matemática: Teoría y Aplicaciones, 2011
A characterization is given for graphs whose matching polynomial is the determinant of their matching matrices. The matching matrix is then modified and its relation with other graph polynomials is examined.
Shanaz A. Wahid
doaj   +1 more source

A Graph Theory-Based Modeling of Functional Brain Connectivity Based on EEG: A Systematic Review in the Context of Neuroergonomics

open access: yesIEEE Access, 2020
Graph theory analysis, a mathematical approach, has been applied in brain connectivity studies to explore the organization of network patterns.
L. Ismail, W. Karwowski
semanticscholar   +1 more source

Graph Theory: A Lost Component For Development in Nigeria

open access: yesJournal of Nigerian Society of Physical Sciences, 2022
Graph theory is one of the neglected branches of mathematics in Nigeria but with the most applications in other fields of research. This article shows the paucity, importance, and necessity of graph theory in the development of Nigeria.
Olayiwola Babarinsa
doaj   +1 more source

On Total H-Irregularity Strength of the Disjoint Union of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
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

Home - About - Disclaimer - Privacy