Results 11 to 20 of about 972,352 (283)
On harmonious chromatic number of triple star graph [PDF]
Journal of Hyperstructures, 2016 A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious ...
Akhlak Mansuri
doaj +1 more source
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
Survey on Large Scale Enterprise-level Knowledge Graph Practices [PDF]
Jisuanji gongcheng, 2020 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
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 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
Journal of Mathematics, 2022 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
Frontiers in Aging Neuroscience, 2021 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
WSEAS TRANSACTIONS ON MATHEMATICS, 2020 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
Pan-American Journal of Mathematics, 2022 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
Applied Network Science, 2023 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
Properties of Hereditary Hypergraphs and Middle Graphs [PDF]
Canadian Mathematical Bulletin, 1978 AbstractThe middle graph of a graph G=( V, E) is the graph M(G) = (V∪E, E′), in which two vertices u, v are adjacent if either M is a vertex in V and v is an edge in E containing u, or u and v are edges in E having a vertex in common. Middle graphs have been characterized in terms of line graphs by Hamada and Yoshimura [7], who also investigated their ...
Cockayne, E. J. +2 more
openaire +1 more source