Results 51 to 60 of about 114,426,441 (303)

Distance 2-Domination in Prisms of Graphs

Discussiones Mathematicae Graph Theory, 2017
A set of vertices D of a graph G is a distance 2-dominating set of G if the distance between each vertex u ∊ (V (G) − D) and D is at most two. Let γ2(G) denote the size of a smallest distance 2-dominating set of G. For any permutation π of the vertex set
Hurtado Ferran, Mora Mercè, Rivera-Campo Eduardo, Zuazua Rita   +3 more
doaj   +1 more source

Variation of sum of two largest eigenvalues of the distance matrices of four-leaf graph

Journal of Hebei University of Science and Technology, 2020
In order to accurately obtain the extremum of the distance eigenvalues of fowr-leaf graphs under tow graph transformations in any case, two graph transformations of four-leaf graphs and the results of the above problems were given by using the properties
Zhe LYU, Yubin GAO
doaj   +1 more source

Distance Critical Graphs

Graphs and Combinatorics
Abstract In 1971, Graham and Pollak provided a formula for the determinant of the distance matrix of any tree on n vertices. Yan and Yeh reproved this by exploiting the fact that pendant vertices can be deleted from trees without changing the remaining entries of the distance matrix.
Joshua N. Cooper, Gabrielle Tauscheck
openaire   +3 more sources

On the distance spectra of graphs

Linear Algebra and its Applications, 2016
20 pages, 3 figures v2.
Aalipour, Ghodratollah, Abiad, Aida, Berikkyzy, Zhanar, Cummings, Jay, De Silva, Jessica, Gao, Wei, Heysse, Kristin, Hogben, Leslie, Kenter, Franklin, Lin, Jephian, Tait, Michael   +10 more
openaire   +4 more sources

Distance in stratified graphs [PDF]

Czechoslovak Mathematical Journal, 2000
A stratified graph is an ordered pair \((G,S)\), where \(G\) is an undirected graph and \(S\) is a partition of its vertex set \(V(G)\) into classes called strata. For any stratum \(X\) the concepts analogous to the basic concepts concerning distance may be defined, namely \(X\)-eccentricity, \(X\)-radius, \(X\)-diameter, \(X\)-center, \(X\)-periphery.
Chartrand, Gary, Hansen, Lisa, Rashidi, Reza, Sherwani, Naveed   +3 more
openaire   +1 more source

Decoding the dynamic extracellular matrix in cancer—3D models and bioscaffolds rewire the rules of tumor progression

FEBS Letters, EarlyView.
Cancer progression is regulated by the dynamic matrix code of the tumor microenvironment, which influences cellular behavior and disease development. Importantly, matrix remodeling in three‐dimensional cancer models more accurately reflects in vivo conditions compared to conventional two‐dimensional systems.
Sylvia Mangani, Konstantinos Spanopoulos, Zoi Piperigkou, Nikos K. Karamanos   +3 more
wiley   +1 more source

On Almost Distance-Regular Graphs [PDF]

2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Fiol, M.A., Dalfo, C., Gorissen, B.L., Garriga, E., Dam, E.R. van   +4 more
core   +2 more sources

Bounds for some distance-based and degree-distance-based topological indices [PDF]

Contributions to Mathematics, 2022
Gul Ozkan Kızılırmak
doaj   +1 more source

Metrics for Single-Edged Graphs over a Fixed Set of Vertices

Mathematical and Computational Applications, 2018
Graphs have powerful representations of all kinds of theoretical or experimental mathematical objects. A technique to measure the distance between graphs has become an important issue.
Ray-Ming Chen
doaj   +1 more source

Orientable -distance magic regular graphs

AKCE International Journal of Graphs and Combinatorics, 2021
Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj   +1 more source