Results 1 to 10 of about 2,650,610 (297)
Domination number of middle graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs,
Farshad Kazemnejad +3 more
doaj +4 more sources
Total domination number of middle graphs
Electronic Journal of Graph Theory and Applications, 2022 A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set.
Farshad Kazemnejad +3 more
doaj +4 more sources
Dual-graph attention autoencoder for spatial domain identification in ischemic stroke [PDF]
Frontiers in NeuroscienceIntroductionSpatial transcriptomics enables molecular mapping of ischemic stroke tissue, but spatial domain identification is challenging when injury disrupts normal tissue geometry.
Yuan-Yuan Chen +5 more
doaj +2 more sources
Fair Fuzzy Matching in Middle Fuzzy Graph [PDF]
Ratio Mathematica, 2022 A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching.
S. Yahya Mohamed, S Suganthi
doaj +2 more sources
On the D-differential of a graph
AKCE International Journal of Graphs and Combinatorics, 2022 Let [Formula: see text] be a graph of order n(G). For a subset S of V(G), the boundary of S is defined as [Formula: see text] where N(S) is the open neighborhood of S.
Kijung Kim
doaj +1 more source
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