Results 21 to 30 of about 258,952 (290)
Survey on Large Scale Enterprise-level Knowledge Graph Practices [PDF]
In recent years,knowledge graph and its related technologies have developed rapidly and have been widely used in various cognitive intelligence scenarios in industry.This paper gives a brief description of researches in knowledge graph,and on this basis ...
WANG Haofen, DING Jun, HU Fanghuai, WANG Xin
doaj +1 more source
On the r-dynamic coloring of some fan graph families
In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and the
Falcón Raúl M. +3 more
doaj +1 more source
On Valuation of Edge Irregularity Strength of Certain Graphical Families
This article comprises of exact valuation of a graph parameter, known as the edge irregularity strength EIS, symbolized as eisG, of various graphical families such as middle graph of path graph, middle graph of cycle graph, snake graph (string 2 ...
Zhiqiang Zhang +4 more
doaj +1 more source
The Cognitive Connectome in Healthy Aging
Objectives: Cognitive aging has been extensively investigated using both univariate and multivariate analyses. Sophisticated multivariate approaches such as graph theory could potentially capture unknown complex associations between multiple cognitive ...
Eloy Garcia-Cabello +12 more
doaj +1 more source
Line Graphs and Middle Graphs that are Divisor Graphs
In this paper it is determined when the line graphs and the middle graphs of some classes of graphs are divisor graphs. Complete characterizations for cycles, trees, complete graphs and complete multipartite graphs whose line graphs (middle graphs) are divisor graphs are obtained. It is also shown that the line graphs and the middle graphs of the cycle
Salah Al-Addasi +2 more
openaire +1 more source
Split Domination Number in Edge Semi-Middle Graph
Let G = (p, q) be a connected graph and Me(G) be its corresponding edge semi-middle graph. A dominating set D ⊆ V [Me(G)] is split dominating set V [Me(G)] – D is disconnected.
Venkanagouda M. Goudar +2 more
doaj +1 more source
Hypergraph is a graph structure that can efficiently express the relationship of multiple nodes and has attracted attention in recent years. As with normal graphs, the structure changes every moment, and it is an important research topic in graph mining ...
Shuta Ito, Takayasu Fushimi
doaj +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Regular Restrained Domination in Middle Graph [PDF]
In this paper, we introduce the new concept called regular restrained domination in middle graph.A set S ? V[M(G)] is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and another vertex in V-S.
Muddebihal, M.H., Mahadevappa, Shobha
core +1 more source
BILANGAN DOMINASI LOKASI PADA LINE PAN GRAPH DAN MIDDLE PAN GRAPH [PDF]
Let G is a simple, connected, and undirected graph. A set D is a subset of V. If every node of V adjacent to at least one node D, then D is a dominating set of the graph G . One of the topics from dominating set is locating dominating set. Locating
Fran, Fransiskus +2 more
core +2 more sources

