Results 1 to 10 of about 1,312,788 (294)
Journal of Graph Algorithms and Applications, 2019 Finding cohesive subgraphs in a network has been investigated in many network mining applications. Several alternative formulations of cohesive subgraph have been proposed, a notable one of them is $s$-club, which is a subgraph whose diameter is at most
Riccardo Dondi +3 more
doaj +4 more sources
On some covering graphs of a graph [PDF]
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 +5 more sources
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
Journal of Graph Theory, 2023 AbstractGiven a finite simple graph , an odd cover of is a collection of complete bipartite graphs, or bicliques, in which each edge of appears in an odd number of bicliques, and each nonedge of appears in an even number of bicliques. We denote the minimum cardinality of an odd cover of by and prove that is bounded below by half of the rank over
Calum Buchanan +6 more
openaire +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
Ramanujan coverings of graphs [PDF]
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016 38 pages, 4 figures, journal version. Shortened version appeared in STOC 2016.
Chris Hall +2 more
openaire +2 more sources
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
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jana Maxová, Jaroslav Nesetril
openaire +1 more source