Zobrazeno 1 - 10
of 56
pro vyhledávání: '"A. C. N. Campos"'
Autor:
Thiago L. A. C. de Araújo, Elzânia S. Pereira, Ivone Y. Mizubuti, Ana C. N. Campos, Marília W. F. Pereira, Eduardo L. Heinzen, Hilton C. R. Magalhães, Leilson R. Bezerra, Luciano P da Silva, Ronaldo L. Oliveira
Publikováno v:
Journal of Animal Science and Biotechnology, Vol 8, Iss 1, Pp 1-12 (2017)
Abstract Background An experiment was conducted to evaluate the effects of feed restriction (FR) and sex on the quantitative and qualitative carcass traits of Morada Nova lambs. Thirty-five animals with an initial body weight of 14.5 ± 0.89 kg and a
Externí odkaz:
https://doaj.org/article/cdf8fac18e2a4dc0a0b9eb2501f1b453
Publikováno v:
Anais do VII Encontro de Teoria da Computação (ETC 2022).
Uma k-rotulação (p, 1)-total de um grafo simples G é uma função π: V(G) ∪ E(G) → {0, . . . , k} em que: |π(uv)−π(u)| ≥ p e |π(uv)−π(v)| ≥ p para uv ∈ E(G); π(uv) ≠ π(vw) para uv, vw ∈ E(G); e π(u) ≠ π(v) para uv ∈
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d60d27d5947017b5dbe93a6f0579d581
https://doi.org/10.5753/etc.2022.223153
https://doi.org/10.5753/etc.2022.223153
Autor:
Atílio G. Luiz, C. N. Campos
Publikováno v:
Graphs and Combinatorics. 38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55f7ba48c7784ac992fd3c3af4a58e70
https://doi.org/10.1007/s00373-022-02492-0
https://doi.org/10.1007/s00373-022-02492-0
Publikováno v:
Graphs and Combinatorics. 36:1655-1673
An injection $$f :V(T) \rightarrow \{0,\ldots ,|E(T)|\}$$ of a tree T is a graceful labelling if $$\{|f(u)-f(v)| :uv \in E(T)\}=\{1,\ldots ,|E(T)|\}$$ . Tree T is 0-rotatable if, for any $$v \in V(T)$$ , there exists a graceful labelling f of T such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d16582eeae121d199e871ff2c4f522a
https://doi.org/10.1007/s00373-020-02226-0
https://doi.org/10.1007/s00373-020-02226-0
Autor:
Leilson Rocha Bezerra, Ronaldo Lopes Oliveira, Luciano Pinheiro da Silva, José Nery Rocha Junior, Rafael Nogueira Furtado, Jocely Gomes Souza, Maria Socorro de Souza Carneiro, Elzania Sales Pereira, Monalisa Eva Santos Evangelista, A. C. N. Campos
Publikováno v:
Canadian Journal of Animal Science. 100:262-271
An experiment was conducted to evaluate the effects of feed restriction and sex class on the intake and digestibility of nutrients as well as meat fatty acid profiles in Santa Ines lambs. Thirty lambs with initial body weights of 13 ± 1.49 kg and ag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d961607d672d839223a9472f60b9e1d
https://doi.org/10.1139/cjas-2019-0079
https://doi.org/10.1139/cjas-2019-0079
Publikováno v:
Journal of Combinatorial Optimization. 39:1038-1059
A labelling of a graph G is a mapping $$\pi :S \rightarrow {\mathcal {L}}$$, where $${\mathcal {L}}\subset {\mathbb {R}}$$ and $$S \subseteq V(G)\cup E(G)$$. If $$S=E(G)$$, $$\pi $$ is an $${\mathcal {L}}$$-edge-labelling and, if $$S=V(G)\cup E(G)$$,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd9176fae4a2cdeb79fca5187d636748
https://doi.org/10.1007/s10878-020-00540-0
https://doi.org/10.1007/s10878-020-00540-0
Publikováno v:
Anais do VI Encontro de Teoria da Computação (ETC 2021).
Uma rotulação L(h, k) é uma atribuição σ de inteiros aos vértices de um grafo simples tal que os rótulos de: vértices adjacentes diferem de pelo menos h; vértices com um vizinho em comum diferem de pelo menos k. A maior diferença entre os
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4b68b76b1d05032c3f58cee45892d3f
https://doi.org/10.5753/etc.2021.16381
https://doi.org/10.5753/etc.2021.16381
Autor:
C. N. Campos, A. L. Jonck Junior
Publikováno v:
Anais do VI Encontro de Teoria da Computação (ETC 2021).
Uma $(m, d)$-coloração $\pi$ de um grafo $G$ é uma atribuição de $m$ cores aos vértices do grafo de maneira que, para todo vértice $u$ de $G$, no máximo $d$ vizinhos de $u$ possuem a cor $\pi(u)$. Neste trabalho, exibimos uma condição neces
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de3e3724845ed0574a9080a5ab550709
https://doi.org/10.5753/etc.2021.16380
https://doi.org/10.5753/etc.2021.16380
Publikováno v:
Anais do VI Encontro de Teoria da Computação (ETC 2021).
A $(2,1)$-total labelling of a simple graph $G$ is a function $\pi \colon V(G)\cup E(G) \to \{0, \ldots, k\}$ such that: $\pi(u) \neq \pi(v)$ for $uv \in E(G)$; $\pi(uv) \neq \pi(vw)$ for $uv, vw \in E(G)$; and $|\pi(uv)-\pi(u)| \geq 2$ and $|\pi(uv)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::439274e52e0242b55d886dbdef65bc14
https://doi.org/10.5753/etc.2021.16390
https://doi.org/10.5753/etc.2021.16390
Publikováno v:
Discrete Applied Mathematics. 268:137-151
A graceful labelling of a tree T is an injective function f : V ( T ) → { 0 , … , | E ( T ) | } such that { | f ( u ) − f ( v ) | : u v ∈ E ( T ) } = { 1 , … , | E ( T ) | } . An α -labelling of a tree T is a graceful labelling f with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b24bb694a5ef0dba4f495cd96203385
https://doi.org/10.1016/j.dam.2019.05.004
https://doi.org/10.1016/j.dam.2019.05.004