Results 61 to 70 of about 1,106 (97)

A New Transport Distance and Its Associated Ricci Curvature of Hypergraphs

Analysis and Geometry in Metric Spaces, 2022
The coarse Ricci curvature of graphs introduced by Ollivier as well as its modification by Lin–Lu– Yau have been studied from various aspects. In this paper, we propose a new transport distance appropriate for hypergraphs and study a generalization of ...
Akamatsu Tomoya
doaj   +1 more source

Antipodal graphs and digraphs

, 1991
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 3, Page 579-586, 1993.
Garry Johns, Karen Sleno
wiley   +1 more source

A Survey on Packing Colorings

Discussiones Mathematicae Graph Theory, 2020
If S = (a1, a2, . . .) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1, X2, . . .
Brešar Boštjan, Ferme Jasmina, Klavžar Sandi, Rall Douglas F.   +3 more
doaj   +1 more source

Coloring the vertices of a graph with mutual-visibility property

Open Mathematics
Given a graph GG, a mutual-visibility coloring of GG is a coloring of the vertices of GG satisfying the following. Two vertices x,y∈V(G)x,y\in V\left(G) can be colored with the same color, if there is a shortest x,yx,y-path whose internal vertices have ...
Klavžar Sandi, Kuziak Dorota, Tripodoro Juan Carlos Valenzuela, Yero Ismael G.   +3 more
doaj   +1 more source

On the Metric Dimensions for Sets of Vertices

Discussiones Mathematicae Graph Theory, 2023
Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, {ℓ}-resolving sets were recently introduced.
Hakanen Anni, Junnila Ville, Laihonen Tero, Puertas María Luz   +3 more
doaj   +1 more source

A cospectral construction for the generalized distance matrix

Special Matrices
The generalized distance matrix of a graph is a matrix in which the (i,j)\left(i,j)th entry is a function, ff, of the distance between vertex ii and vertex jj.
Friesen Ori, Kolko Cecily, Layman Nick, Lorenzen Kate, Zaske Sarah, Zeigler Amy   +5 more
doaj   +1 more source

The bipartite Laplacian matrix of a nonsingular tree

Special Matrices, 2023
For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix.
Bapat Ravindra B., Jana Rakesh, Pati Sukanta   +2 more
doaj   +1 more source

A Characterization for 2-Self-Centered Graphs

Discussiones Mathematicae Graph Theory, 2018
A graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements.
Shekarriz Mohammad Hadi, Mirzavaziri Madjid, Mirzavaziri Kamyar   +2 more
doaj   +1 more source

Bounds on F-index of tricyclic graphs with fixed pendant vertices

Open Mathematics, 2020
The F-index F(G) of a graph G is obtained by the sum of cubes of the degrees of all the vertices in G. It is defined in the same paper of 1972 where the first and second Zagreb indices are introduced to study the structure-dependency of total π-electron ...
Akram Sana, Javaid Muhammad, Jamal Muhammad   +2 more
doaj   +1 more source

The Second Neighbourhood for Bipartite Tournaments

Discussiones Mathematicae Graph Theory, 2019
Let T (X ∪ Y, A) be a bipartite tournament with partite sets X, Y and arc set A. For any vertex x ∈ X ∪Y, the second out-neighbourhood N++(x) of x is the set of all vertices with distance 2 from x.
Li Ruijuan, Sheng Bin
doaj   +1 more source