| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Fed Univ ABC, Ctr Math Comp & Cognit, Sao Paulo - Brazil
[2] Univ Sao Paulo, Inst Math & Stat, Sao Paulo - Brazil
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | DISCRETE APPLIED MATHEMATICS; v. 292, p. 33-44, MAR 31 2021. |
| Web of Science Citations: | 0 |
| Abstract | |
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 D of G such that every subgraph H is an element of D is locally irregular. A graph is said to be decomposable if it admits a locally irregular decomposition. We prove that any decomposable split graph can be decomposed into at most three locally irregular subgraphs and we characterize all split graphs whose decomposition can be into one, two or three locally irregular subgraphs. (C) 2020 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 17/23623-4 - Partition problems in graphs and digraphs |
| Grantee: | Maycon Sambinelli |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 18/04876-1 - Ramsey theory, structural graph theory and applications in Bioinformatics |
| Grantee: | Guilherme Oliveira Mota |
| Support Opportunities: | Research Grants - Young Investigators Grants |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |