AbstractIn “On signed digraphs with all cycles negative”, Discrete Appl. Math. 12 (1985) 155–164, F. Harary, J.R. Lundgren and J.S. Maybee, identify certain families of such digraphs: the class of strong and upper digraphs and the class Ū. We give here a characterization of the latter class and new proofs of two results concerning these classes, by using the c-minimal strongly connected digraphs. This note answers some questions of the authors
AbstractDefine a chordally signed graph to be a signed chordal graph (meaning that each edge is desi...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
summary:In our earlier paper [9], generalizing the well known notion of graceful graphs, a $(p,m,n)...
AbstractIn “On signed digraphs with all cycles negative”, Discrete Appl. Math. 12 (1985) 155–164, F....
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
summary:The set $D$ of distinct signed degrees of the vertices in a signed graph $G$ is called its s...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
In this paper we strive towards a mathematical theory for “marked digraphs ” in which the nodes are ...
AbstractThe strong independence number βs(D) of a digraph D is the maximum cardinality of a set S of...
AbstractIn [B.M. Kim, B.C. Song, W. Hwang, Primitive graphs with given exponents and minimum number ...
Knuth proposed to compare his method and those of Luce for studying strongly connected digraphs. Cha...
AbstractA branch of a strong diagraph is a path whose endpoint have degree at least three and whose ...
AbstractWe introduce adequate concepts of expansion of a digraph to obtain a sequential construction...
AbstractDefine a chordally signed graph to be a signed chordal graph (meaning that each edge is desi...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
summary:In our earlier paper [9], generalizing the well known notion of graceful graphs, a $(p,m,n)...
AbstractIn “On signed digraphs with all cycles negative”, Discrete Appl. Math. 12 (1985) 155–164, F....
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
It is known that signed graphs with all cycles negative are those in which each block is a negative ...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
summary:The set $D$ of distinct signed degrees of the vertices in a signed graph $G$ is called its s...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
In this paper we strive towards a mathematical theory for “marked digraphs ” in which the nodes are ...
AbstractThe strong independence number βs(D) of a digraph D is the maximum cardinality of a set S of...
AbstractIn [B.M. Kim, B.C. Song, W. Hwang, Primitive graphs with given exponents and minimum number ...
Knuth proposed to compare his method and those of Luce for studying strongly connected digraphs. Cha...
AbstractA branch of a strong diagraph is a path whose endpoint have degree at least three and whose ...
AbstractWe introduce adequate concepts of expansion of a digraph to obtain a sequential construction...
AbstractDefine a chordally signed graph to be a signed chordal graph (meaning that each edge is desi...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
summary:In our earlier paper [9], generalizing the well known notion of graceful graphs, a $(p,m,n)...