Search

Your search keyword '"Cerioli, Márcia R."' showing total 37 results
Start Over Author "Cerioli, Márcia R."
37 results on '"Cerioli, Márcia R."'

1. Transversals of Longest Paths

Author

Cerioli, Márcia R., Fernandes, Cristina G., Gómez, Renzo, Gutiérrez, Juan, and Lima, Paloma T.

Subjects
Computer Science - Discrete Mathematics, Mathematics - Combinatorics
Abstract

Let $\lpt(G)$ be the minimum cardinality of a set of vertices that intersects all longest paths in a graph $G$. Let $\omega(G)$ be the size of a maximum clique in $G$, and $\tw(G)$ be the treewidth of $G$. We prove that $ \lpt(G) \leq \max\{1,\omega(G)-2\}$ when $G$ is a connected chordal graph; that $\lpt(G) =1$ when $G$ is a connected bipartite permutation graph or a connected full substar graph; and that $\lpt(G) \leq \tw(G)$ for any connected graph $G$., Comment: 19 pages, 9 figures

Published
2017

2. Edge-magic labelings for constellations and armies of caterpillars

Author

Cerioli, Márcia R., Fernandes, Cristina G., Lee, Orlando, Lintzmayer, Carla N., Mota, Guilherme O., and da Silva, Cândida N.

Subjects
Mathematics - Combinatorics, 05C78
Abstract

Let $G=(V,E)$ be an $n$-vertex graph with $m$ edges. A function $f : V \cup E \rightarrow \{1, \ldots, n+m\}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some integer $k$, we have $f(u)+f(v)+f(uv) = k$ for every edge $uv \in E$. Furthermore, if $f(V) = \{1, \ldots, n\}$, then we say that $f$ is a super edge-magic labeling. A constellation, which is a collection of stars, is symmetric if the number of stars of each size is even except for at most one size. We prove that every symmetric constellation with an odd number of stars admits a super edge-magic labeling. We say that a caterpillar is of type $(r,s)$ if $r$ and $s$ are the sizes of its parts, where $r \leq s$. We also prove that every collection with an odd number of same-type caterpillars admits an edge-magic labeling.

Published
2017

3. Presenting Basic Graph Logic

Author

Cerioli, Márcia R., Suguitani, Leandro, Viana, Petrucio, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Basu, Amrita, editor, Stapleton, Gem, editor, Linker, Sven, editor, Legg, Catherine, editor, Manalo, Emmanuel, editor, and Viana, Petrucio, editor

Published
2021
Full Text
View/download PDF

14. On the (In)Dependence of the Peano Axioms for Natural Numbers.

Author

Cerioli, Márcia R., Nobrega, Hugo, Silveira, Guilherme, and Viana, Petrucio

Subjects
*NATURAL numbers, *PEANO axioms, *ALGEBRA, *MATHEMATICAL analysis, *MATHEMATICS
Abstract

We investigate two notions of independence—(usual) independence and complete independence—applied to the Peano axioms for the sequence of natural numbers. We review the results that, although they are independent, the Peano axioms are not completely independent. The standard proof that the Peano axioms are not completely independent is algebraic, in the sense that it makes essential reference to the relationship between several mathematical structures that satisfy, or do not satisfy, these axioms. We then present an alternative logical proof, which makes no essential references to the relationship between mathematical structures. There is a completely independent set of axioms for the sequence of natural numbers, but it is based on primitives different from those originally adopted by Peano. Therefore, we present a new completely independent set of axioms based on the same set of primitives as the one originally adopted by Peano. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

15. Transversals of longest paths

Author

Cerioli, Márcia R., primary, Fernandes, Cristina G., additional, Gómez, Renzo, additional, Gutiérrez, Juan, additional, and Lima, Paloma T., additional

Published
2020
Full Text
View/download PDF

17. On Edge-magic Labelings of Forests

Author

Cerioli, Márcia R., primary, Fernandes, Cristina G., additional, Lee, Orlando, additional, Lintzmayer, Carla N., additional, Mota, Guilherme O., additional, and da Silva, Cândida N., additional

Published
2019
Full Text
View/download PDF

19. Transversals of Longest Paths

Author

Cerioli, Márcia R., primary, Fernandes, Cristina G., additional, Gómez, Renzo, additional, Gutiérrez, Juan, additional, and Lima, Paloma T., additional

Published
2017
Full Text
View/download PDF

22. On Edge-magic Labelings of Forests.

Author

Fernandes, Cristina G., Lee, Orlando, Lintzmayer, Carla N., Mota, Guilherme O., da Silva, Cândida N., and Cerioli, Márcia R.

Subjects
LABELS, GEOMETRIC vertices, CATERPILLARS, INTEGERS, VALUATION
Abstract

Given an n -vertex graph G = (V , E) with m edges, a labeling f of V ∪ E that uses all the labels in the set {1,2,..., n + m } is edge-magic if there is an integer k such that f (u) + f (v) + f (uv) = k for every edge uv ∈ E. Furthermore, if the labels in {1,2,..., n } are given to the vertices, then f is called super edge-magic. Kotzig [On magic valuations of trichromatic graphs, Reports of the CRM, 1971] started the investigation of super edge-magic labelings of forests. Following this line of research, we prove that some forests of stars admit a super edge-magic labeling and that some forests of caterpillars admit an edge-magic labeling. [ABSTRACT FROM AUTHOR]

Published
2019
Full Text
View/download PDF

34. Tree loop graphs

Author

Alcón, Liliana, primary, Cerioli, Márcia R., additional, de Figueiredo, Celina M.H., additional, Gutierrez, Marisa, additional, and Meidanis, João, additional

Published
2007
Full Text
View/download PDF

35. Loop Graphs and Asteroidal Sets

Author

Alcón, Liliana, primary, Cerioli, Márcia R., additional, de Figueiredo, Celina M.H., additional, Gutierrez, Marisa, additional, and Meidanis, João, additional

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results