Results 221 to 230 of about 974,445 (260)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. [PDF]

Algorithmica
Eiben E, Ganian R, Kanj I, Ordyniak S, Szeider S.   +4 more
europepmc   +1 more source

MIND versus MSN: A systematic evaluation of test-retest reliability and age sensitivity for T1-weighted structural similarity networks. [PDF]

Netw Neurosci
Gao J, Hu Y.
europepmc   +1 more source

Radiofrequency catheter ablation of persistent atrial fibrillation in a patient with cor triatriatum sinister. [PDF]

Heart Rhythm O2
Hasebe H, Furuyashiki Y, Yoshida K.
europepmc   +1 more source

A daily three-dimensional dataset of the Kuroshio axis and boundaries in the East China Sea and Luzon Strait. [PDF]

Sci Data
Wang J, Chen X, Mao K, Zhang C.
europepmc   +1 more source

Total edge irregularity strength of subdivision of star

Journal of Discrete Mathematical Sciences and Cryptography, 2015
This research is the development from Siddiqui's research on edge irregularity strength of subdivision of star.
Hasmawati Basir
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

The distance-edge-monitoring numbers of subdivision graphs

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yaping Mao, Eddie Cheng, Ralf Klasing
exaly   +3 more sources

Complexity of subdivision-vertex and subdivision-edge join graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2022
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph. The generalized graph entropies result from applying information measures to a graph using various schemes for defining probability distributions over ...
Zeynep Berberler
exaly   +2 more sources

On (Super) Edge-Magic Total Labeling of Subdivision of K1,3

SUT Journal of Mathematics, 2007
Rinovia Simanjuntak, Edy Tri Baskoro
exaly   +2 more sources

Restrained geodetic domination of edge subdivision graph

Discrete Mathematics, Algorithms and Applications, 2021
For a connected graph [Formula: see text], a set [Formula: see text] subset of [Formula: see text] is said to be a geodetic set if all vertices in G should lie in some [Formula: see text] geodesic for some [Formula: see text]. The minimum cardinality of the geodetic set is the geodetic number.
John Joy Mulloor, V. Sangeetha
openaire   +2 more sources

$K_4$-Subdivisions Have the Edge-Erdös--Pósa Property

SIAM Journal on Discrete Mathematics, 2021
We prove that every graph $G$ contains either $k$ edge-disjoint $K_4$-subdivisions or a set $X$ of at most $O(k^8 \log k)$ edges such that $G-X$ does not contain any $K_4$-subdivision. This shows that $K_4$-subdivisions have the edge-Erdős-Pósa property.
Henning Bruhn, Matthias Heinlein
openaire   +1 more source