Results 1 to 10 of about 506,942 (112)
Soft document clustering using a novel graph covering approach [PDF]
BioData Mining, 2018 Background In text mining, document clustering describes the efforts to assign unstructured documents to clusters, which in turn usually refer to topics. Clustering is widely used in science for data retrieval and organisation.
Jens Dörpinghaus +2 more
doaj +2 more sources
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Mathematics, 2022 Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems.
Huiqin Jiang +4 more
doaj +1 more source
The topological ordering of covering nodes [PDF]
Communications in Combinatorics and Optimization, 2020 The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the
G.H. Shirdel, N. Kahkeshani
doaj +1 more source
On the Edge Covering Transversal Edge Domination in Graphs
Ratio Mathematica, 2023 Let G = (V,E) be any graph with nvertices and medges. An edge dominating set which intersects every minimum edge covering set in a graph Gis called an edge covering transversal edge dominating set of G.
E Sherin Danie, S Robinson Chellathurai
doaj +1 more source
On Edge H-Irregularity Strengths of Some Graphs
Discussiones Mathematicae Graph Theory, 2021 For a graph G an edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t. In this case we say that G admits an (H1, H2, . . . , Ht)-(edge) covering.
Naeem Muhammad +4 more
doaj +1 more source
Mathematics, 2023 A fuzzy graph G is stated to have a set of trees as its tree cover if all the vertices of G are in their union. The maximum weight tree in the tree cover is assumed to be the cost of a tree cover for a fuzzy graph.
Anushree Bhattacharya, Madhumangal Pal
doaj +1 more source
Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings [PDF]
Transactions on Combinatorics, 2022 The unitary Cayley graph $\Gamma_n$ of a finite ring $\mathbb{Z}_n$ is the graph with vertex set $\mathbb{Z}_n$ and two vertices $x$ and $y$ are adjacent if and only if $x-y$ is a unit in $\mathbb{Z}_n$. A family $\mathcal{F}$ of mutually edge disjoint
Denpong Pongpipat, Nuttawoot Nupo
doaj +1 more source
On some covering graphs of a graph
Electronic Journal of Graph Theory and Applications, 2016 For a graph $G$ with vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$.
Shariefuddin Pirzada +2 more
doaj +1 more source
Data Allocation Algorithm for Large Data with All-to-all Comparison Based on Graph Covering [PDF]
Jisuanji gongcheng, 2018 In the process of distributed processing of all-to-all comparison problem for large data,the existing data allocation strategies think less of the special dependency between the comparison task and the data,which lead to the low storage efficiency and ...
GAO Yanjun,ZHANG Xueying,LI Fenglian,TIAN Yuchu
doaj +1 more source
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
doaj +1 more source