AbstractA graph G is defined to be semiharmonic if there is a constant μ (necessarily a natural number) such that, for every vertex v, the number of walks of length 3 starting in v equals μdG(v) where dG(v) is the degree of v. We determine all finite semiharmonic trees and monocyclic graphs
AbstractDenote by M(n) the smallest positive integer such that for every n-element monoid M there is...
AbstractA simple connected graph G is said to be interval distance monotone if the interval I(u,v) b...
AbstractFor any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it ...
AbstractA graph G is defined to be semiharmonic if there is a constant μ (necessarily a natural numb...
Dress A, Grünewald S. Semiharmonic trees and monocyclic graphs. Applied Mathematics Letters. 2003;16...
AbstractClassification of harmonic and semiharmonic graphs according to their cyclomatic number beca...
AbstractLet the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that,...
AbstractThe aim of this note is to call attention to a simple regularity regarding the number of wal...
AbstractLet Wk denote the number of walks of length k(≥ 0) in a finite graph G, and define Δk = Δk(G...
AbstractLet G be a graph on n vertices v1,v2,…,vn and let d(vi) be the degree (= number of first nei...
A set S of vertices of a connected graph G is a monophonic set of G if each vertex v of G lies on a ...
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose l...
For a connected graph , let be amonophonic diametral path of . A set is called a monophonic set of...
In this paper, firstly, we define a new graph based on the semi-direct product of a free abelian mon...
22 pages, 6 figuresWe investigate Cayley graphs of finite semigroups and monoids. First, we look at ...
AbstractDenote by M(n) the smallest positive integer such that for every n-element monoid M there is...
AbstractA simple connected graph G is said to be interval distance monotone if the interval I(u,v) b...
AbstractFor any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it ...
AbstractA graph G is defined to be semiharmonic if there is a constant μ (necessarily a natural numb...
Dress A, Grünewald S. Semiharmonic trees and monocyclic graphs. Applied Mathematics Letters. 2003;16...
AbstractClassification of harmonic and semiharmonic graphs according to their cyclomatic number beca...
AbstractLet the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that,...
AbstractThe aim of this note is to call attention to a simple regularity regarding the number of wal...
AbstractLet Wk denote the number of walks of length k(≥ 0) in a finite graph G, and define Δk = Δk(G...
AbstractLet G be a graph on n vertices v1,v2,…,vn and let d(vi) be the degree (= number of first nei...
A set S of vertices of a connected graph G is a monophonic set of G if each vertex v of G lies on a ...
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose l...
For a connected graph , let be amonophonic diametral path of . A set is called a monophonic set of...
In this paper, firstly, we define a new graph based on the semi-direct product of a free abelian mon...
22 pages, 6 figuresWe investigate Cayley graphs of finite semigroups and monoids. First, we look at ...
AbstractDenote by M(n) the smallest positive integer such that for every n-element monoid M there is...
AbstractA simple connected graph G is said to be interval distance monotone if the interval I(u,v) b...
AbstractFor any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it ...
DOI
Add to ORKG