Results 1 to 10 of about 652,005 (320)
Discussiones Mathematicae Graph Theory, 2016 We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi Lorenzo
doaj +5 more sources
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 SystemsWe 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 +5 more
doaj +2 more sources
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the EPT graph (i.e. the edge intersection graph) of P.
Arman Boyacı +3 more
doaj +3 more sources
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 +2 more
doaj +9 more sources
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +6 more sources
Split Domination in Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2021 This paper demonstrates a concept of split domination in neutrosophic graphs.Minimal split domination, lower and upper split dominations in neutrosophic graphs are discussed.
M. Mullai +3 more
doaj +2 more sources
A neural machine translation method based on split graph convolutional self-attention encoding. [PDF]
PeerJ Comput SciWan F, Li P.
europepmc +2 more sources
Divisor equitably strong non-split divisor equitable domination in graphs
Mathematics in Applied Sciences and EngineeringIn 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. +2 more
doaj +3 more sources
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 +2 more
doaj +1 more source