| Full text | |
| Author(s): |
Lintzmayer, C. N.
;
Mota, G. O.
;
Sambinelli, M.
Total Authors: 3
|
| Document type: | Journal article |
| Source: | ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE; v. 346, p. 10-pg., 2019-08-30. |
| 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 of G into locally irregular subgraphs. A graph is said to be decomposable if it admits a locally irregular decomposition. In this paper we prove that any decomposable split graph whose clique has at least 10 vertices can be decomposed into at most three locally irregular subgraphs. Furthermore, we characterize those whose decomposition can be into one or two locally irregular subgraphs. (AU) | |
| 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: | 17/23623-4 - Partition problems in graphs and digraphs |
| Grantee: | Maycon Sambinelli |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| 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 |