Results 131 to 140 of about 34,455 (233)
Line Cut Vertex Digraphs Of Digraphs
, 2015 In this paper we define the digraph valued function (digraph operator) namely the line cut vertex digraph Lc(D) of a digraph D. The problem of reconstructing a digraph from its line cut vertex digraph is presented. Also, outer planarity and maximal outer planarity properties of these digraphs are discussed.
Nagesh.H.M, R.Chandrasekhar
openaire +1 more source
A sufficient condition for 𝑘-path Hamiltonian digraphs [PDF]
, 1976 John A G Roberts
openalex +1 more source
Finite-dimensional flexible algebras associated with directed and weighted CW complexes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria MatematicaIn this paper, we study a link between directed and weighted CW complexes (also called configurations) and flexible algebras determining which configurations are associated with those algebras.
Ceballos Manuel
doaj +1 more source
For How Many Edges is a Digraph Almost Certainly Hamiltonian? [PDF]
, 1973 E. M. Wright
openalex +1 more source
ON ALGORITHMS TO OBTAIN DIGRAPHS REPRESENTING DYNAMICAL BEHAVIORS ASSOCIATED WITH A SINGLE NEURONIC EQUATION [PDF]
, 1976 Shojiro Tagawa
openalex +1 more source
Linear Algebra and its Applications, 2010 AbstractIn this primarily expository paper we survey classical and some more recent results on the spectra of digraphs, equivalently, the spectra of (0,1)-matrices, with emphasis on the spectral radius.
openaire +2 more sources
Algorithms for constructing graphs and digraphs with given valences and factors
, 1973 Daniel J. Kleitman, D. L. Wang
openalex +1 more source
On the vertex-degree based invariants of digraphs [PDF]
Discrete Mathematics Letters, 2021 Hanyuan Deng +4 more
doaj +1 more source