Zobrazeno 1 - 10
of 84
pro vyhledávání: '"E.I. Milovanovic"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics. 11:11-20
Let G = (V,E ), V = [v \,v2, . . . , vn}, be a simple connected graph with n vertices, m edges and vertex degree sequence d1 > d2 > ■■■ > dn > 0, di = d(vi ). General zeroth-order Randic index of G is defined as °Ra (G) = Ση=ι d" > and gene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69f5f39667658928cbf1e95565fd36fb
https://doi.org/10.5937/spsunp1901011m
https://doi.org/10.5937/spsunp1901011m
Publikováno v:
Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics. 10:99-106
Let G = (V;E), V = f1;2;:::;ng, be a simple graph of order n and size m, without isolated vertices. Denote by ∆ = d1 ≥ d2 ≥ ··· ≥ dn = d > 0, di = d(i), a sequence of its vertex degrees. If vertices i and j are adjacent, we write i ∼ j.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42fad9a95a8c1bd776ca1612ba19edf3
https://doi.org/10.5937/spsunp1802099z
https://doi.org/10.5937/spsunp1802099z
Publikováno v:
Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics. 10:49-54
Let G = (V,E), V = {1,2 … n}, be a simple connected graph with n vertices and m edges and let d1 ≥ d2 … ≥ dn > 0, be the sequence of vertex degrees. With i ~ j we denote the adjacency of the vertices i and j in graph G. With AG = Σi~j di+dj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abfe94c6b00420a952b5e6410d2b42db
https://doi.org/10.5937/spsunp1801049m
https://doi.org/10.5937/spsunp1801049m
Publikováno v:
Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics. 10:107-114
Let G = (V;E), V = f1;2;:::;ng, be a simple connected graph of order n and size m, with sequence of vertex degrees ∆ = d1 ≥ d2 ≥ ··· ≥ dn = d > 0, di = d(i). Denote by m1 ≥ m2 ≥ ··· ≥ mn-1 > mn = 0 the Laplacian eigenvalues of G.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::327d7045a98fbaa70f39216b04c15561
https://doi.org/10.5937/spsunp1802107g
https://doi.org/10.5937/spsunp1802107g
Publikováno v:
Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics. 9:19-24
Let G be a simple connected graph with n vertices and m edges with vertex degree sequence d1 ≥ d2 ≥ . . . ≥ dn > 0. Denote by F = Σni =1 d3i forgotten topological index of graph G. In this paper we give some lower bounds for invariant F. Also,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::827c96336fd9c6648c56676fdd7fe9d7
https://doi.org/10.5937/spsunp1701019m
https://doi.org/10.5937/spsunp1701019m
Autor:
E.I. Milovanovic, I.Z. Milovanovic
Publikováno v:
Kragujevac Journal of Science, Vol 2017, Iss 39, Pp 77-89 (2017)
Let G be a simple graph of order n ≥ 2 with m edges. Denote by d1 ≥ d2 ≥ · · · ≥ dn > 0 the sequence of vertex degrees and by μ1 ≥ μ2 ≥ · · · ≥ μn−1 > μn = 0 the Laplacian eigenvalues of the graph G. Lower bounds for the Kir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::024645ac0e452fdb87333ef5fff093a5
http://scindeks-clanci.ceon.rs/data/pdf/1450-9636/2017/1450-96361739077M.pdf
http://scindeks-clanci.ceon.rs/data/pdf/1450-9636/2017/1450-96361739077M.pdf
Publikováno v:
Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics. 8:21-34
Let Γ(G) be a set of all simple graphs of order n and size m, without isolated vertices, with vertex degree sequence d1 ≥ d2 ≥ ... ≥ dn > 0. A graph G is regular if and only if d1 = d2 = ... = dn . Each mapping Irr: Γ(G) ›→ [0, +∞) with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::355fabd2c610012fdeaf94020e96521c
https://doi.org/10.5937/spsunp1601021m
https://doi.org/10.5937/spsunp1601021m
Publikováno v:
Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics (2015) 7(1):25-31
Let G be an undirected connected graph with n, n ≥ 3, vertices and m edges. If μ1 ≥ μ2 … ≥ μn-1 > μn = 0 and ρ1 ≥ ρ2 ≥ …≥ ρn-1 > ρn = 0 are the Laplacian and the normalized Laplacian eigenvalues of G, then the Kirchhoff and th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d20f16aa6b630275280837c2f7c720e
https://doi.org/10.5937/spsunp1501025m
https://doi.org/10.5937/spsunp1501025m
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.