• Publications
  • Influence
New sufficient conditions for equality of minimum degree and edge-connectivity
  • 28
  • 7
On the well - coveredness of products of graphs
A hair waving device and method wherein a connector part is provided with a pair of spaced walls extending generally longitudinally of each other from the connector part, the walls having smoothlyExpand
  • 24
  • 7
A classification of locally semicomplete digraphs
In [17] Huang gave a characterization of local tournaments. His characterization involves arc-reversals and therefore may not be easily used to solve other structural problems on locally semicompleteExpand
  • 54
  • 6
Characterization of graphs with equal domination and covering number
Abstract Let G be a simple graph of order n ( G ). A vertex set D of G is dominating if every vertex not in D is adjacent to some vertex in D , and D is a covering if every edge of G has at least oneExpand
  • 37
  • 6
Edge-cuts leaving components of order at least three
Let G be a graph with vertex set V(G) and edge set E(G). For X ⊆ V(G) let G[X] be the subgraph induced by X,X = V(G) - X, and (X,X) the set of edges in G with one end in X and the other in X. If G isExpand
  • 78
  • 5
Roman bondage in graphs
A Roman dominating function on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2.Expand
  • 15
  • 5
Degree sequence conditions for maximally edge-connected graphs depending on the clique number
Abstract In this paper we give degree sequence conditions for the equality of edge-connectivity and minimum degree of a graph with given clique number.
  • 18
  • 5
Wiener index versus maximum degree in trees
The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. In this paper, we characterize the trees which minimize the Wiener index among all trees of given order andExpand
  • 137
  • 4
Cycles in multipartite tournaments: results and problems
  • L. Volkmann
  • Computer Science, Mathematics
  • Discret. Math.
  • 28 February 2002
A tournament is an orientation of a complete graph, and in general a multipartite tournament is an orientation of a complete n-partite graph. Many results about cycles in tournaments are known, butExpand
  • 53
  • 4