In this paper, we introduce a novel graph polynomial called the 'information polynomial' of a graph. This graph polynomial can be derived by using a probability distribution of the vertex set. By using the zeros of the obtained polynomial, we additionally define some novel spectral descriptors. Compared with those based on computing the ordinary characteristic polynomial of a graph, we perform ...

We present a new graph based semi-supervised learning algorithm, using multiway cut on a neighborhood graph to achieve an optimum classification. We also present a graph based feature selection algorithm utilizing the global structure of the graph derived from both labeled and unlabeled examples. With respect to the experiments we conducted, both of our approaches are proved to have a promising...

In this paper we describe a coreference resolution method that employs a classification and a clusterization phase. In a novel way, the clusterization is produced as a graph cutting algorithm, in which nodes of the graph correspond to the mentions of the text, whereas the edges of the graph constitute the confidences derived from the coreference classification. In experiments, the graph cutting...

In this paper we study proximity structures like Delaunay triangulations based on geometric graphs, i.e. graphs which are subgraphs of the complete geometric graph. Given an arbitrary geometric graph G, we define several Voronoi diagrams, Delaunay triangulations, relative neighborhood graphs, Gabriel graphs and then study their complexities when G is a general geometric graph or G is some speci...

Abstract The development of knowledge management and service enlightens the upgrading traditional vocational education work assistance. This focuses on field substation proposes a novel method based domain graph. Specifically, systematic three-layer graph is constructed, reflecting physical entity, specialized basic in substations. Furthermore, model established to translate user’s demand into ...

In this paper signal flow graph non-linear modeling of cascade buck converters is presented. Unified signal flow graph model of the converter is developed and then deduction of large, small-signal and steadystate models from the unified graph is demonstrated. Converter performance expressions are derived. Largesignal model is developed and programmed in TUTSIM simulator. Large-signal responses ...

purpose: to separate and characterize orbital fat-derived stem cells (ofscs) and compare its cellular and molecular properties with those of bone marrow-derived mesenchymal stem cells (mscs) and adipose-derived stem cells (ascs). methods: stem cells from orbital fat, abdominal fat and bone marrow aspirates have been isolated. we assessed stem cell specific cell surface markers using cytometry, ...

a signed graph (marked graph) is an ordered pair $s=(g,sigma)$$(s=(g,mu))$, where $g=(v,e)$ is a graph called the underlyinggraph of $s$ and $sigma:erightarrow{+,-}$$(mu:vrightarrow{+,-})$ is a function. for a graph $g$, $v(g),e(g)$ and $c(g)$ denote its vertex set, edge set and cut-vertexset, respectively. the lict graph $l_{c}(g)$ of a graph $g=(v,e)$is defined as the graph having vertex set ...

Wireless Sensor Network (WSN) is considered to be one of the fundamental technologies employed in Internet things (IoT); hence, enabling diverse applications for carrying out real-time observations. Robot navigation such networks was main motivation introduction concept landmarks. A robot can identify its own location by sending signals obtain distances between itself and Considering a type gra...

let $g$ be a group. the order graph of $g$ is the (undirected)graph $gamma(g)$,those whose vertices are non-trivial subgroups of $g$ and two distinctvertices $h$ and $k$ are adjacent if and only if either$o(h)|o(k)$ or $o(k)|o(h)$. in this paper, we investigate theinterplay between the group-theoretic properties of $g$ and thegraph-theoretic properties of $gamma(g)$. for a finite group$g$, we s...