Results 31 to 40 of about 121,460 (194)
Extending Undirected Graph Techniques to Directed Graphs via Category Theory
We use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra +4 more
doaj +1 more source
Intrinsic Reduced Attitude Formation with Ring Inter-Agent Graph [PDF]
This paper investigates the reduced attitude formation control problem for a group of rigid-body agents using feedback based on relative attitude information.
Hong, Yiguang +4 more
core +2 more sources
Android Malware Detection Based on API Pairing
Aiming at the problem that the permission-based detection is too coarse-grained, a malware detection method based on sensitive application program interface(API) pairing is proposed.
doaj +1 more source
Finite automata with undirected state graphs [PDF]
AbstractWe investigate finite automata whose state graphs are undirected. This means that for any transition from state p to q consuming some letter a from the input there exists a symmetric transition from state q to p consuming a letter a as well.
Kutrib, Martin +3 more
openaire +4 more sources
Video steganalysis scheme based on weighted undirected graph
A new steganalysis scheme based on taking the inter-frame correlation as the undirected graph weights was proposed utilizing the temporal correlation among video frames.First,getting the eigenvector of every video frame brightness by calculating its gray-
Ting DA, Zhi-tang LI
doaj +2 more sources
A growing number of studies are focusing on methods to estimate and analyze the functional connectome of the human brain. Graph theoretical measures are commonly employed to interpret and synthesize complex network-related information.
Allegra Conti +5 more
doaj +1 more source
Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
For a partially ordered set (A,≤)(A,\le ), let GA{G}_{A} be the simple, undirected graph with vertex set A such that two vertices a≠b∈Aa\ne b\in A are adjacent if either a≤ba\le b or b≤ab\le a.
Badawi Ayman, Rissner Roswitha
doaj +1 more source
Indeterminate strings, prefix arrays & undirected graphs
An integer array y = y[1..n] is said to be feasible if and only if y[1] = n and, for every i \in 2..n, i \le i+y[i] \le n+1. A string is said to be indeterminate if and only if at least one of its elements is a subset of cardinality greater than one of a given alphabet Sigma; otherwise it is said to be regular.
Christodoulakis, M. +3 more
openaire +3 more sources
On molecular graphs and digraphs of annulenes and their spectra [PDF]
Amolecular graph, consisting of undirected edges, can be represented as a sum of two digraphs, consisting of oppositely oriented directed edges.
PETER J. PLATH, IVAN GUTMAN
doaj +3 more sources
Incidence matrices and line graphs of mixed graphs
In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result.
Abudayah Mohammad +2 more
doaj +1 more source

