Centrality is a family of metrics for characterizing the importance vertex in graph. Although large number centrality have been proposed, majority them ignores uncertainty graph data. In this paper, we formulate closeness on uncertain graphs and define batch evaluation problem that computes subset vertices an We develop three algorithms, MS-BCC , MG-BCC MGMS-BCC based sampling to approximate sp...

let $g$ be a non-abelian finite group. in this paper, we prove that $gamma(g)$ is $k_4$-free if and only if $g cong a times p$, where $a$ is an abelian group, $p$ is a $2$-group and $g/z(g) cong mathbb{ z}_2 times mathbb{z}_2$. also, we show that $gamma(g)$ is $k_{1,3}$-free if and only if $g cong {mathbb{s}}_3,~d_8$ or $q_8$.

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

Reachability query is a fundamental problem in graph databases. It answers whether or not there exists a path between a source vertex and a destination vertex and is widely used in various applications including road networks, social networks, world wide web and bioinformatics. In some emerging important applications, uncertainties may be inherent in the graphs. For instance, each edge in a gra...

We consider the problem of reconfiguration planning in modular robots. Current techniques for reconfiguration planning usually specify the destination configuration for a modular robot explicitly. We posit that in uncertain environments the desirable configuration for a modular robot is not known beforehand and has to be determined dynamically. In this paper, we consider this problem of how to ...

In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with the following intended meaning: If the first one is true then the second will be true at the next step. More generally, a certainty level representing the lower bound of a necessity measure can be associated with the sec...

This paper presents a contribution to programming by human demonstration, in the context of compliant motion task specification for sensor-controlled robot systems that physically interact with the environment. Onewants to learn about the geometric parameters of the task and segment the totalmotion executed by the human into subtasks for the robot that can each be executed with simple compliant...

In this paper we introduce a novel algorithm for incorporating uncertainty into lookahead planning. Our algorithm searches through connected graphs with uncertain edge costs represented by known probability distributions. As a robot moves through the graph, the true edge costs of adjacent edges are revealed to the planner prior to traversal. This locally revealed information allows the planner ...

Argumentation can be modelled at an abstract level using a directed graph where each node denotes an argument and each arc denotes an attack by one argument on another. Since arguments are often uncertain, it can be useful to quantify the uncertainty associated with each argument. Recently, there have been proposals to extend abstract argumentation to take this uncertainty into account. This as...

Large graphs are prevalent in social networks, traffic networks, and biology. These graphs are often inexact. For example, in a friendship network, an edge between two nodesu andv indicates that users u and v have a close relationship. This edge may only exist with a probability. To model such information, the uncertain graph model has been proposed, in which each edge e is augmented with a pro...