• No results found

Graph structures

ON HYPER ZAGREB INDEX OF CERTAIN GENERALIZED GRAPH STRUCTURES

ON HYPER ZAGREB INDEX OF CERTAIN GENERALIZED GRAPH STRUCTURES

... hyper Zagreb index of certain generalized graph structures such as generalized thorn graphs and generalized theta graphs. Also,for the first time, we determine exact values for hyper Zagreb index of some ...

24

On Third Leap Zagreb Index of Some Generalized Graph Structures

On Third Leap Zagreb Index of Some Generalized Graph Structures

... Abstract— Let G be a connected graph with n vertices. The 2- degree of a vertex v in G is the number of vertices which are at distance two from v in G. The third leap Zagreb index of G is the sum of product of ...

6

Topics in graph colouring and graph structures

Topics in graph colouring and graph structures

... of graph theory stemming from the eponymous theorem which, in its simplest form, states that any sufficiently large graph will contain a clique or anti-clique of a specified ...underlying graph which ...

292

Graph Structures Matching for Review Relevance Identification

Graph Structures Matching for Review Relevance Identification

... Context matching compares edges with same and dif- ferent syntax, and edges of different types across two text graphs. We refer to the match as context matching since contiguous phrases (vertices) are chosen from a ...

8

On the Sparing Number of Certain Graph Structures

On the Sparing Number of Certain Graph Structures

... floral graph are of same parity, then is called a like- petal graph and if petals are of different parities, then is called a mixed-petal ...floral graph are alternately odd and even, then is called ...

10

Some Insights Towards a Unified Semantic Representation of Explanation for eXplainable Artificial Intelligence

Some Insights Towards a Unified Semantic Representation of Explanation for eXplainable Artificial Intelligence

... From this representation, the core-meaning of causality in explanations can be expressed with enables and causes relations, which underlie de- ductive, inductive and abducting reasoning in ex- planations as argued by ...

6

Volume 26: Manipulation of Graphs, Algebras and Pictures

Volume 26: Manipulation of Graphs, Algebras and Pictures

... of) graph structures at the instance level, it follows that state transitions can be adequately specified by the use of graph structure ...applying graph structure transformations 4 ...

22

Dating Documents using Graph Convolution Networks

Dating Documents using Graph Convolution Networks

... internal structures. In this paper, we pro- pose NeuralDater, a Graph Convolutional Network (GCN) based document dating approach which jointly exploits syntactic and temporal graph structures ...

11

Graph Based Generation of Referring Expressions

Graph Based Generation of Referring Expressions

... general, graph-theoretic approach to the generation of referring ...directed graph and describe the content selection problem (which proper- ties and relations to include in a description for an object?) as ...

20

The use of structures in communication networks to track membership in terrorist groups

The use of structures in communication networks to track membership in terrorist groups

... the graph structures that may indicate terrorist activities (a technique that can be coupled with the dynamic analysis presented earlier) while the third method compares two static snapshots taken over time ...

18

Authenticated Data Structures for Graph and Geometric Searching

Authenticated Data Structures for Graph and Geometric Searching

... data structures graph algorithms and geometric algorithms These schemes are directed mainly at defending the user against an inadvertent error made during ...combinatorial graph structures), ...

7

Authentication of Data Structures for Graph

Authentication of Data Structures for Graph

... data structures and algorithms so that their responses can be varied as accurately as if they were coming from their author, even when the response is coming from an un-trusted host? Digital signatures can be used ...

6

Sampling edge covers

Sampling edge covers

... a graph G = (V, E) is a subset W ⊆ E of edges such that each vertex v ∈ V is the endpoint of at least one edge in W ...in graph theory via the bijective equivalence of their analogous structures on ...

51

ANALYSYS AND DESIGN OF VARIOUS BRACING SYSTEM IN HIGH RISE STEEL STRUCTURES.

ANALYSYS AND DESIGN OF VARIOUS BRACING SYSTEM IN HIGH RISE STEEL STRUCTURES.

... steel structures are now a day’s very popular because of the ease of erection and high strength- weight ...rise structures from the lateral loads like wind and earthquake is ...

7

Assessing classical input output structures with trade networks: A graph theory approach

Assessing classical input output structures with trade networks: A graph theory approach

... The main advantage of our schematic representation, compared with other visualization techniques, is the focus on trade-cycle loops . The relative findings from our illustrative examples bring out three different cases. ...

30

A Graph-Theoretical Approach for Partitioning RNA Secondary Structures into Pseudonotted and Pseudoknot-free Regions

A Graph-Theoretical Approach for Partitioning RNA Secondary Structures into Pseudonotted and Pseudoknot-free Regions

... dual graph, not illustrated in ...dual graph is generated (see Definition ...dual graph representations of these properties, are either cycles of length 2, single edges, a cycle of length r, or an ...

5

Graph based Neural Networks for Event Factuality Prediction using Syntactic and Semantic Structures

Graph based Neural Networks for Event Factuality Prediction using Syntactic and Semantic Structures

... Event factuality prediction (EFP) is the task of assessing the degree to which an event men- tioned in a sentence has happened. For this task, both syntactic and semantic information are crucial to identify the important ...

7

Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis

Compile- and run-time approaches for the selection of efficient data structures for dynamic graph analysis

... data structures perform the overhead of looking up this identi- fier in the corresponding hash table and potentially determining its location in ...data structures is still faster for small lists, ...

22

Software Testing part2

Software Testing part2

... • This matrix is also used to evaluate the control structures present in the program during testing. • Graph matrix is a square matrix of the size NxN ,[r] ...

34

ProtNN: fast and accurate protein 3D-structure classification in structural and topological space

ProtNN: fast and accurate protein 3D-structure classification in structural and topological space

... Proteins are ubiquitous in the living cells. They play key roles in the functional and evo- lutionary machinery of species. Studying protein functions and structures is paramount for understanding the molecular ...

17

Show all 10000 documents...

Related subjects