Results 1 to 10 of about 94,998 (262)

Recognition of Unipolar and Generalised Split Graphs [PDF]

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   +2 more sources

Merge-and-Split Graph Convolutional Network for Skeleton-Based Interaction Recognition [PDF]

Cyborg and Bionic Systems
We introduce an innovative approach to address a significant challenge in interaction recognition, specifically the capture of correlation features between different interaction body parts.
Haoqiang Wang, Yong Wang, Sheng Yan, Xin Du, Yuan Gao, Hong Liu   +5 more
doaj   +2 more sources

On the shelling antimatroids of split graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal, Jean-Paul Doignon, Keno Merckx   +2 more
doaj   +2 more sources

Divisor equitably strong non-split divisor equitable domination in graphs

Mathematics in Applied Sciences and Engineering
In epidemiology, the spread of diseases can be modelled using graphs, where individuals are nodes, and edges represent potential pathways for disease transmission.
Priyanka G. B., Xavier P, J. Catherine Grace John   +2 more
doaj   +2 more sources

A neural machine translation method based on split graph convolutional self-attention encoding. [PDF]

PeerJ Comput Sci
Wan F, Li P.
europepmc   +2 more sources

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, K.C. Rajendra Prasad, K.M. Niranjan   +2 more
doaj   +1 more source

Fast Diameter Computation within Split Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2021
When can we compute the diameter of a graph in quasi linear time? We address this question for the class of {\em split graphs}, that we observe to be the hardest instances for deciding whether the diameter is at most two.
Guillaume Ducoffe, Michel Habib, Laurent Viennot   +2 more
doaj   +1 more source

Adding a Tail in Classes of Perfect Graphs

Algorithms, 2023
Consider a graph G which belongs to a graph class C. We are interested in connecting a node w∉V(G) to G by a single edge uw where u∈V(G); we call such an edge a tail.
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios   +2 more
doaj   +1 more source

PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS

Tạp chí Khoa học Đại học Đà Lạt, 2020
Let G be a graph with n vertices. Suppose that for each vertex v in G there exists a list L(v) of k colors, such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph.
Lê Xuân Hùng
doaj   +1 more source

Forbidden subgraphs in reduced power graphs of finite groups

AIMS Mathematics, 2021
Let G be a finite group. The reduced power graph of G is the undirected graph whose vertex set consists of all elements of G, and two distinct vertices x and y are adjacent if either ⟨x⟩⊂⟨y⟩ or ⟨y⟩⊂⟨x⟩. In this paper, we show that the reduced power graph
Huani Li , Ruiqin Fu, Xuanlong Ma
doaj   +1 more source