All Outputs (31)

Automated construction of variable density navigable networks in a 3D indoor environment for emergency response (2016)
Journal Article

© 2016 Elsevier B.V. Widespread human-induced or natural threats on buildings and their users have made preparedness and rapid response crucial issues for saving human lives. The ability to identify the paths of egress during an emergency is critical... Read More about Automated construction of variable density navigable networks in a 3D indoor environment for emergency response.

The probabilistic approach to limited packings in graphs (2015)
Journal Article

© 2014 Elsevier B.V. All rights reserved. We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for every vertex vεV(G), |N[v]∩X|≤k, where N[v] is the closed neighbourhoo... Read More about The probabilistic approach to limited packings in graphs.

Braess' paradox in a generalised traffic network (2014)
Journal Article

Copyright © 2014 John Wiley & Sons, Ltd. Braess' paradox illustrates situations when adding a new link to a transport network might lead to an equilibrium state in which travel times of users will increase. The classical network configuration intro... Read More about Braess' paradox in a generalised traffic network.

The bondage number of graphs on topological surfaces and Teschner's conjecture (2013)
Journal Article

The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, and improve upper bounds... Read More about The bondage number of graphs on topological surfaces and Teschner's conjecture.

On Roman, Global and Restrained Domination in Graphs (2011)
Journal Article

In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible. Moreover, we give upper bounds for the restrained domination and total restrained do... Read More about On Roman, Global and Restrained Domination in Graphs.

The Computer System GRAPHOGRAPH (2006)
Journal Article

The domination parameters of cubic graphs (2005)
Journal Article

Let ir(G), γ(G), i(G), β0(G), Γ(G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively. In t... Read More about The domination parameters of cubic graphs.

Locally well-dominated and locally independent well-dominated graphs (2003)
Journal Article

In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irred... Read More about Locally well-dominated and locally independent well-dominated graphs.

Bipartition of graphs into subgraphs with prescribed hereditary properties (2003)
Journal Article

On the differences of the independence, domination and irredundance parameters of a graph (2003)
Journal Article

Proof of a conjecture on irredundance perfect graphs (2002)
Journal Article

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = γ(H), for every induced subgraph H of G. In this article we present a result which immediately imp... Read More about Proof of a conjecture on irredundance perfect graphs.

A disproof of Henning's conjecture on irredundance perfect graphs (2002)
Journal Article

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = γ(H), for every induced subgraph H of G. In this paper, we disprove the known conjecture of Hennin... Read More about A disproof of Henning's conjecture on irredundance perfect graphs.

Perfect graphs of strong domination and independent strong domination (2001)
Journal Article

Let γ(G), i(G), γs(G) and is(G) denote the domination number, the independent domination number, the strong domination number and the independent strong domination number of a graph G, respectively. A graph G is called γi-perfect (domination perfect)... Read More about Perfect graphs of strong domination and independent strong domination.

A semi-induced subgraph characterization of upper domination perfect graphs (1999)
Journal Article

Let β(G) and Γ(G) be the independence number and the upper domination number of a graph G, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classe... Read More about A semi-induced subgraph characterization of upper domination perfect graphs.

Upper domination and upper irredundance perfect graphs (1998)
Journal Article

Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. A graph G is called IR-perfect if Γ(H)... Read More about Upper domination and upper irredundance perfect graphs.

Line hypergraphs: A survey (1998)
Journal Article

The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. This function generalizes two classical concepts at once, namely the line graph and the dual hypergraph. In a certain sense, line graphs and dual hyperg... Read More about Line hypergraphs: A survey.

The Ratio of the Irredundance Number and the Domination Number for Block-Cactus Graphs (1998)
Journal Article

Let γ(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc. 9th Southeast Conf. on Combin., Graph Theory & Comp. (1978) 43-56] and Bollobás and Cockayne [J. Graph Theory (1979) 241-2... Read More about The Ratio of the Irredundance Number and the Domination Number for Block-Cactus Graphs.

The binding number of a random graph (1997)
Journal Article

Line hypergraphs (1996)
Journal Article

In this paper, we introduce a new multivalued function ℒ called the line hypergraph. The function ℒ generalizes two classical concepts at once, namely, of the line graph and the dual hypergraph. In terms of this function, proofs of some known theorem... Read More about Line hypergraphs.

An induced subgraph characterization of domination perfect graphs (1995)
Journal Article

Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectively. A graph (G) is called domination perfect if γ(H) = ι(H), for every induced subgraph H of (G). There are many results giving a partial characterizat... Read More about An induced subgraph characterization of domination perfect graphs.