Results 11 to 20 of about 1,392,860 (268)
Barekeng, 2022 One of the concepts in mathematics that developing rapidly today is Graph Theory. The development of Graph Theory has been combined with Group Theory, that is by representing a group in a graph.
Dewi Santri Ramdani +2 more
doaj +1 more source
On the beta-number of linear forests with an even number of components
AKCE 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 strong beta-number of galaxies with three and four components
AKCE International Journal of Graphs and Combinatorics, 2020 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 if there exists no such integer .
Rikio Ichishima +2 more
doaj +1 more source
On the K-theory of twisted higher-rank-graph C*-algebras [PDF]
, 2012 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
AKCE 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
Graph Theory and Networks in Biology [PDF]
, 2006 In this paper, we present a survey of the use of graph theoretical techniques in Biology. In particular, we discuss recent work on identifying and modelling the structure of bio-molecular networks, as well as the application of centrality measures to ...
Mason, Oliver, Verwoerd, Mark
core +3 more sources
Mathematical Structures in Computer Science, 2008 A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the λβ or the least sensible λ-theory ℋ (which is generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there are a minimal λ-theory and a minimal ...
BUCCIARELLI A, SALIBRA, Antonino
openaire +4 more sources
Gradient-prolongation commutativity and graph theory [PDF]
, 2005 This Note gives conditions that must be imposed to algebraic multilevel discretizations involving at the same time nodal and edge elements so that a gradient-prolongation commutativity condition will be satisfied; this condition is very important, since ...
François Musy +7 more
core +5 more sources
Regularity lemmas in a Banach space setting [PDF]
, 2015 Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B.
Regts, Guus
core +8 more sources
The Determinant of Matching Matrix in the Evaluation of Matching Polynomial
Revista 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