neighborhood-graphs
Navigating the Semantic Horizon using Relative Neighborhood Graphs
... semantic models represent and handle vagueness and polysemy. We have argued that the structure — or topology — of the local neighborhoods in se- mantic models carry useful semantic information regarding the different ...
10
Graph Laplacians and their Convergence on Random Neighborhood Graphs
... weighted graphs and then simplify the general case to undirected ...the neighborhood graphs studied in this paper, followed by an introduction to the so called weighted Laplace-Beltrami operator, ...
44
On common neighborhood graphs II
... two graphs, ∈ ( ), and ∈ ( ). Then the Hajós join of these two graphs, which is denoted by ∆ ,is a new graph that combines the two graphs by identifying vertices and into a single vertex, removing ...
10
Hitting and Commute Times in Large Random Neighborhood Graphs
... Positive implication: Efficient computation of approximate commute distances. In some ap- plications the commute distance is not used as a distance function, but as a tool to encode the connectivity properties of a ...
48
On Edge Neighborhood Graphs
... The neighborhood graph N(G) of a graph G = (V, E) is the graph with the vertex set V∪S where S is the set of all open neighborhood sets of vertices of G and with two vertices u, v ∈ V ∪ S adjacent if u ∈ V ...
5
Spectra of Some New Graph Operations and Some New Class of Integral Graphs
... corona, neighborhood corona, common neighborhood graphs, ...two graphs have been introduced and their spectra are ...two graphs and provided a complete description of their ...R-vertex ...
15
Online Full Text
... its neighborhood in G can be partitioned into a clique and a stable set in ...split-neighborhood graphs (SNAP) if G is perfect and every induced subgraph of G contains a split ...triangulated ...
6
The Neighborhood Graph of a Graph
... The neighborhood graph N(G) of a graph G = (V, E) is the graph with the vertex set V∪S where S is the set of all open neighborhood sets of G and with two vertices u, v ∈ V∪S adjacent if u ∈ V and v is an ...
8
Neighborhood spaces
... a neighborhood of x if x ∈ I(V ...these neighborhood collections, when appropriately axiomatized in Section 2, will define a neighborhood structure ν on X, and the pair (X,ν) is called a ...
13
Upper domination and upper irredundance perfect graphs
... Γ-perfect graphs in terms of some family of forbidden induced subgraphs, and show that the class of Γ-perfect graphs is a subclass of IR-perfect graphs and that the class of absorbantly perfect ...
11
Topological Properties of Bismuth tri-iodide Using Neighborhood M-Polynomial
... molecular graphs and ℝ is the set of real ...on neighborhood degree sum of vertex [2]-[8]. By neighborhood degree sum𝛿 𝑢 of a vertex𝑢, we mean the sum of degrees of all ...
8
Vol 11, No 6 (2020)
... status neighborhood index, product connectivity status neighborhood index, reciprocal product connectivity status neighborhood index, modified first and second status neighborhood indices, ...
7
s13148-020-00830-8.pdf
... objective neighborhood characteristics by trained assessors as opposed to self-report by the resi- ...the neighborhood by those residing there to be separated from objective neighborhood ...
10
Neighborhood Sets and Neighborhood Polynomials of Cycles
... neighborhood sets of C n − 3 and C n − 4 with cardinality i − 1 . Therefore, we need to consider C n i − − 1 1 and C n i − − 1 2 . The families of these neighborhood sets can be empty or otherwise. Thus, we ...
7
On the Non Common Neighbourhood Energy of Graphs
... Abstract In this paper, we introduce a new type of graph energy called the non-common-neighborhood energy ENCN G , NCN-energy for some standard graphs is obtained and an upper bound fo[r] ...
6
Trends in Fuzzy Graphs
... T. Dinesh and T.V. Ramakrishnan (2011) introduced the concept of a fuzzy graph structure based on the concept of graph structure. A new concept, namely, graph structure has been introduced by E. Sampathkumar which, in ...
5
Vol 8, No 2 (2017)
... Keywords: Square fuzzy graphs, regular fuzzy graphs, strong fuzzy graphs, complete fuzzy graphs, order and size of fuzzy graphs.. AMS Mathematics subject classification (2010):.[r] ...
5
Equivalence among some neighborhood structures in fuzzy topology
... the neighborhood structures are intro- duced in a general form, that is, as functions defined even without a topological ...the neighborhood structure studied in ...
15
Sufficient Conditions for The Existence of Fractional Factors in Different Settings
... n ≥ 6k−8. Later, this concept was extended to the fractional ID-[a, b]-factor-critical graph by Zhou et al. in [7], i. e., a graph G is fractional ID-[a, b]-factor-critical if G − I admits a fractional [a, b]-factor for ...
10
Neighborhood aesthetics
... there and wallpaper construction, store which the exhibit the was concentrating or and be could interior an seen the the of opening overall exterior of view the as front places, the land[r] ...
23