Results 41 to 50 of about 258,952 (290)
On the bondage number of middle graphs
Mathematical Notes, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aytac, A., Turaci, T., Odabas, Z. N.
openaire +4 more sources
On Strong Split Middle Domination of a Graph [PDF]
, 2016 The middle graph M(G) of graph G is obtained by inserting a vertex xi in the “middle” of each edge ei, 1 ? i ? |E(G)|, and adding the edge xixj for 1?i ? j ? |E(G)| if and only if ei and ej have a common vertex.
, Dr. M.H. Muddebihal, Megha Khandelwal
core +2 more sources
Regular number of Middle graph of a graph [PDF]
, 2016 For any (p ,q) graph G, the middle graph of a graph G, is denoted by M(G), is a graph whose vertex set is V(G)?E(G), and two vertices are adjacent if they are adjacent edges of G or one is a vertex and other is an edge incident with it.
, M. H. Muddebihal, Abdul Gaffar
core +2 more sources
Histograms of the transformed correlation coefficients between the RGB channels: ζ(1) (top graph), ζ(2) (middle graph), and ζ(3) (bottom graph). [PDF]
, 2023 Histograms of the transformed correlation coefficients between the RGB channels: ζ(1) (top graph), ζ(2) (middle graph), and ζ(3) (bottom graph).
Laura Rebollo-Neira (5638214) +1 more
core +1 more source
Frontiers in Aging Neuroscience, 2020 Mild cognitive impairment (MCI) is often considered a critical time window for predicting early conversion to Alzheimer’s disease (AD). Brain functional connectome data (i.e., functional connections, global and nodal graph metrics) based on resting-state
Xiaowen Xu +13 more
doaj +1 more source
Bioengineering, 2023 Neuropathic pain (NP) following spinal cord injury (SCI) is refractory to pain control strategies, and the underlying neuronal mechanisms remain poorly understood.
Eunhee Park +6 more
doaj +1 more source
A numeral system for the middle-levels graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2021 The middle-levels graph $M_k ...
openaire +4 more sources
Graph-Guided Banding of the Covariance Matrix [PDF]
, 2018 Regularization has become a primary tool for developing reliable estimators of the covariance matrix in high-dimensional settings. To curb the curse of dimensionality, numerous methods assume that the population covariance (or inverse covariance) matrix ...
Jacob Bien (767406)
core +1 more source
Vertex semi-middle graph of a graph
Malaya Journal of Matematik, 2019 In this communication, the vertex semi-middle graph of a graph $M_v(G)$ is introduced. We obtain a characterization of graphs whose $M_v(G)$ is planar, outerplanar and minimally non-outerplanar. Further, we obtain $M_v(G)$ is Eulerian, crossing number one and crossing number two.
null Rajendra Prasad K C +2 more
openaire +1 more source
On k-rainbow domination in middle graphs [PDF]
RAIRO - Operations Research, 2021 Let G be a finite simple graph with vertex set V(G) and edge set E(G). A function f : V(G) → P({1,2,…,k}) is a k-rainbow dominating function on G if for each vertex v∈V(G) for which f(v) = ∅, it holds that ⋃u∈N(v) f(u) = {1,2,…,k}. The weight of a k-rainbow dominating function is the value ∑v∈V(G)|f(v)|.
openaire +2 more sources