Results 221 to 230 of about 15,436 (257)

Association Between Ipsilateral Stroke and Nonstenotic (<50%) Carotid Disease: Secondary Analysis From the AcT Trial. [PDF]

J Am Heart Assoc
Ignacio KHD, Nagendra S, Bala F, Alhabli I, Kaveeta C, Tanaka K, Baguley E, Poulin T, Sjonnesen K, Horn M, Dowlatshahi D, Shamy M, Khosravani H, Swartz RH, Catanese L, Tkach A, Buck B, Field T, Hunter G, Shankar J, Sajobi T, Menon BK, Almekhlafi MA, Ganesh A, Singh N.   +24 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Irregularity strength of dense graphs

Journal of Graph Theory, 2008
AbstractLet G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f: E(G) → {1, 2,…, w}. For a vertex v, f(v) is defined as the sum f(e) over all edges e of G incident with v. f is called irregular, if all f(v) are distinct.
Cuckler, Bill, Lazebnik, Felix
openaire   +2 more sources

D-irregularity Strength of a Graph

Utilitas Mathematica
We initiate to study a \(D\)-irregular labeling, which generalizes both non-inclusive and inclusive \(d\)-distance irregular labeling of graphs. Let \(G=(V(G),E(G))\) be a graph, \(D\) a set of distances, and \(k\) a positive integer. A mapping \(\varphi\) from \(V(G)\) to the set of positive integers \(\{1,2,\dots,k\}\) is called a \(D\)-irregular \(k\
Susanto, Faisal, Simanjuntak, Rinovia, Baskoro, Edy Tri   +2 more
openaire   +2 more sources

Total Vertex Irregularity Strength of Dense Graphs

Journal of Graph Theory, 2013
AbstractConsider a graph of minimum degree δ and order n. Its total vertex irregularity strength is the smallest integer k for which one can find a weighting such that for every pair of vertices of G. We prove that the total vertex irregularity strength of graphs with is bounded from above by .
Majerski, P., Przybyło, J.
openaire   +2 more sources

Total Edge Irregularity Strength of Toroidal Fullerene

Mathematics in Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin, Lascsáková, Marcela, Siddiqui, Muhammad Kamran   +2 more
openaire   +1 more source

Upper Bounds on Inclusive Distance Vertex Irregularity Strength

Graphs and Combinatorics, 2021
An inclusive distance vertex irregular labeling of a graph $G$ is an assignment of positive integers \(\{1,2,3,\dots,k\}\) to the vertices of $G$ such that for every vertex the sum of numbers assigned to its closed neighborhood is different. The minimum number $k$ for which an inclusive distance vertex irregular labeling of $G$ exists is denoted by ...
Sylwia Cichacz, Agnieszka Görlich, Andrea Semaničová-Feňovčíková   +2 more
openaire   +1 more source

On edge irregularity strength of graphs

Applied Mathematics and Computation, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmad, Ali, Al-Mushayt, Omar Bin Saeed, Bača, Martin   +2 more
openaire   +2 more sources

On the irregularity strength of trees

Journal of Graph Theory, 2004
AbstractFor any graph G, let ni be the number of vertices of degree i, and $\lambda (G)={max} _{i\le j}\{ {n_i+\cdots +n_j+i-1\over j}\}$. This is a general lower bound on the irregularity strength of graph G. All known facts suggest that for connected graphs, this is the actual irregularity strength up to an additive constant.
Bohman, Tom, Kravitz, David
openaire   +1 more source