Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Paula Rama"'
Publikováno v:
Aposta, Vol 4, Iss 4 (2004)
En pocos años veremos incrementar el porcentaje de ancianos en nuestro país; de ahí que sea necesario adoptar políticas encaminadas a satisfacer sus demandas y necesidades, así como su bienestar social. Sobre todo porque en las sociedades indus
Externí odkaz:
https://doaj.org/article/33e4e90848e04a958138d8bdc527fe65
A caterpillar graph $T(p_1, \ldots, p_r)$ of order $n= r+\sum_{i=1}^r p_i$, $r\geq 2$, is a tree such that removing all its pendent vertices gives rise to a path of order $r$. In this paper we establish a necessary and sufficient condition for a real
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7f4d4de9e984ce5dd280217754152eb
http://hdl.handle.net/10773/32779
http://hdl.handle.net/10773/32779
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
For a (simple) graph $H$ and non-negative integers $c_0,c_1,\ldots,c_d$ ($c_d \neq 0$), $p(H)=\sum_{k=0}^d{c_k \cdot H^k}$ is the lexicographic polynomial in $H$ of degree $d$, where the sum of two graphs is their join and $c_k \cdot H^k$ is the join
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce6629a450d9b2e3b7f9451dad4f8249
Autor:
Silva, Paula Rama1
Publikováno v:
International Journal of Interdisciplinary Social Sciences. 2010, Vol. 5 Issue 5, p423-437. 15p. 8 Illustrations.
Autor:
Paula Carvalho, Paula Rama
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Given a simple and connected graph G with vertex set V , denoting by dG(u) the degree of a vertex u and dG(u, v) the distance of two vertices, the modified Schultz index of G is given by S ∗ P (G) = {u,v}⊆V dG(u) dG(v) dG(u, v), where the summati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b279222b322a4191286cbbbe1b6bed6c
Autor:
Paula Carvalho, Paula Rama
Publikováno v:
Linear Algebra and its Applications. 432:2409-2417
A subset of the vertex set of a graph G , W ⊆ V ( G ) , is a ( k , τ ) -regular set if it induces a k -regular subgraph of G and every vertex not in the subset has τ neighbors in it. In this paper we deal with the existence of ( k , τ ) -regular
Autor:
Paula Rama Silva
Publikováno v:
The International Journal of Interdisciplinary Social Sciences: Annual Review. 5:423-438
Autor:
Domingos M. Cardoso, Paula Rama
Publikováno v:
Discrete Mathematics. 307:1306-1316
A set of vertices S@?V(G) is (k,@t)-regular if it induces a k-regular subgraph of G such that |N"G(v)@?S|=@t@?v@?S. Note that a connected graph with more than one edge has a perfect matching if and only if its line graph has a (0,2)-regular set. In t
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Let G be a simple graph on $n$ vertices and $e(G)$ edges. Consider $Q(G) = D + A$ as the signless Laplacian of $G$, where $A$ is the adjacency matrix and $D$ is the diagonal matrix of the vertices degree of $G$. Let $q_1(G)$ and $q_2(G)$ be the first
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1cb2d8cc8d23dc901e9d6fe316825ac
http://hdl.handle.net/10773/16230
http://hdl.handle.net/10773/16230
Autor:
Domingos M. Cardoso, Paula Rama
Publikováno v:
Journal of Mathematical Sciences. 120:869-880