By assigning a certain direction to the webgraphs, which are defined as the Cartesian product of cycles and paths, we prove that they are nonderogatory
We study the problem of characterizing the directed graphs with an upward straight-line embedding in...
A graph consists of a set V of vertices (or nodes) and a set E of edges (or links) that connect some...
One of the main advantages of the Logic of Nested Conditions, defined by Habel and Pennemann, for re...
A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. We fin...
Abstract. A directed graph G is nonderogatory if its adjacency matrix A is nonderogatory, i.e., the ...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
This thesis presents the different orientations of some special classes of digraphs, specifically or...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
A classification of various types of unlabled topologies and transition relations that counts up to ...
A $(0,1)$-labelling of a set is said to be {\em friendly} if approximately one half the elements of ...
Let G be a finite graph which does not have free vertices. We consider G as a topological space in t...
Following the lead of Stanley and Gessel, we consider a linear map which associates to an acyclic di...
We study the problem of characterizing the directed graphs with an upward straight-line embedding in...
A graph consists of a set V of vertices (or nodes) and a set E of edges (or links) that connect some...
One of the main advantages of the Logic of Nested Conditions, defined by Habel and Pennemann, for re...
A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. We fin...
Abstract. A directed graph G is nonderogatory if its adjacency matrix A is nonderogatory, i.e., the ...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
This thesis presents the different orientations of some special classes of digraphs, specifically or...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
A classification of various types of unlabled topologies and transition relations that counts up to ...
A $(0,1)$-labelling of a set is said to be {\em friendly} if approximately one half the elements of ...
Let G be a finite graph which does not have free vertices. We consider G as a topological space in t...
Following the lead of Stanley and Gessel, we consider a linear map which associates to an acyclic di...
We study the problem of characterizing the directed graphs with an upward straight-line embedding in...
A graph consists of a set V of vertices (or nodes) and a set E of edges (or links) that connect some...
One of the main advantages of the Logic of Nested Conditions, defined by Habel and Pennemann, for re...
DOI
Add to ORKG