Results 11 to 20 of about 652,005 (320)
Representing Split Graphs by Words [PDF]
Discussiones Mathematicae Graph Theory, 2022 There is a long line of research in the literature dedicated to word-representable graphs, which generalize several important classes of graphs. However, not much is known about word-representability of split graphs, another important class of graphs.
Chen Herman Z.Q. +2 more
doaj +4 more sources
Discrete Mathematics & Theoretical Computer Science, 2007 An undirected graph G=(V,E) is a probe split graph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) where N is independent and there exists E' ⊆ N× N such that G'=(V,E∪ E') is a split graph. Recently Chang et al.
Van Bang Le, H.N. de Ridder
doaj +5 more sources
Rainbow Colouring of Split Graphs [PDF]
Discrete Applied Mathematics, 2014 A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one rainbow path.
L. Sunil Chandran +2 more
openalex +3 more sources
Decomposing Split Graphs into Locally Irregular Graphs [PDF]
Electronic Notes in Theoretical Computer Science, 2019 A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph $G$ is a decomposition $\mathcal{D}$ of $G$ such that every subgraph $H \in \mathcal{D}$ is locally irregular. A graph is said to be decomposable if it admits a locally irregular decomposition. We prove that any decomposable
Carla Négri Lintzmayer +2 more
openalex +4 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 +2 more
doaj +1 more source
Split Clique Graph Complexity [PDF]
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alcón, Liliana Graciela +3 more
openaire +3 more sources
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
Groups for which the noncommuting graph is a split graph [PDF]
International Journal of Group Theory, 2017 The noncommuting graph $nabla (G)$ of a group $G$ is a simple graph whose vertex set is the set of noncentral elements of $G$ and the edges of which are the ones connecting two noncommuting elements. We determine here, up to isomorphism, the structure of
Marzieh Akbari, Alireza Moghaddamfar
doaj +1 more source
Fully decomposable split graphs [PDF]
European Journal of Combinatorics, 2009 We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is fully decomposable, that is, whether it can be partitioned into connected parts of orders a1,a2,…,ak for every a1,a2,…,ak summing up to the order of the graph.
Broersma, H. J. +2 more
openaire +4 more sources