Results 21 to 30 of about 21,593 (217)

Recognition of Unipolar and Generalised Split Graphs

Algorithms, 2015
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar.
Colin McDiarmid, Nikola Yolov
doaj   +1 more source

Partition-Merge: Distributed Inference and Modularity Optimization

IEEE Access, 2021
This paper presents a novel meta-algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our novel randomized
Vincent Blondel, Kyomin Jung, Pushmeet Kohli, Devavrat Shah, Seungpil Won   +4 more
doaj   +1 more source

Bounds for partition dimension of M-wheels

Open Physics, 2019
Resolving partition and partition dimension have multipurpose applications in computer, networking, optimization, mastermind games and modelling of chemical substances.
Hussain Zafar, Kang Shin Min, Rafique Muqdas, Munir Mobeen, Ali Usman, Zahid Aqsa, Saleem Muhammad Shoaib   +6 more
doaj   +1 more source

$k$-Efficient partitions of graphs [PDF]

Communications in Combinatorics and Optimization, 2019
A set $S = \{u_1,u_2, \ldots, u_t\}$ of vertices of $G$ is an efficient dominating set if every vertex of $G$ is dominated exactly once by the vertices of $S$.
M. Chellali, Teresa W. Haynes, Stephen T. Hedetniemi   +2 more
doaj   +1 more source

ON THE DIAMETER AND CONNECTIVITY OF BIPARTITE KNESER TYPE-k GRAPHS [PDF]

Journal of Algebraic Systems
Let $n\in \mathbb{Z}^{+}$, $n>1$, and $k$ be an integer, $1\leq k \leq n-1$. The graph $H_{T}(n,k)$ is defined as a graph with vertex set $V$, as all non-empty subsets of $\mathcal{S}_n=\{1,2,3,\ldots,n\}$.
Sreeja Ponnamma, Sreekumar Kesavan pillai G., Manilal Karunakaran   +2 more
doaj   +1 more source

Edge-partitioning graphs into regular and locally irregular components [PDF]

Discrete Mathematics & Theoretical Computer Science, 2016
A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs.
Julien Bensmail, Brett Stevens
doaj   +1 more source

An Improved Approach to the PageRank Problems

Journal of Applied Mathematics, 2013
We introduce a partition of the web pages particularly suited to the PageRank problems in which the web link graph has a nested block structure. Based on the partition of the web pages, dangling nodes, common nodes, and general nodes, the hyperlink ...
Yue Xie, Ting-Zhu Huang, Chun Wen, De-An Wu   +3 more
doaj   +1 more source

Relative timing information and orthology in evolutionary scenarios

Algorithms for Molecular Biology, 2023
Background Evolutionary scenarios describing the evolution of a family of genes within a collection of species comprise the mapping of the vertices of a gene tree T to vertices and edges of a species tree S.
David Schaller, Tom Hartmann, Manuel Lafond, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth   +5 more
doaj   +1 more source

The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles

Electronic Journal of Graph Theory and Applications, 2019
Farrell introduced the general class of graph polynomials which he called the family polynomials, or F-polynomials, of graphs. One of these is the cycle, or circuit, polynomial.
Vladimir R. Rosenfeld
doaj   +1 more source

Computational methods for airspace sectorisation

Informatika, 2021
A problem of combining elementary sectors of an airspace region is considered, in which a minimum number of combined sectors must be obtained with restrictions on their load and feasibility of combinations such as the requirement of the space ...
I. V. Rubanov, M. Y. Kovalyov
doaj   +1 more source