Results 21 to 30 of about 390,128 (262)

The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs

Theory and Applications of Graphs, 2023
The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari, Mohammad Abudayah, Manal Ghanem   +2 more
doaj   +1 more source

Encapsulation structure and dynamics in hypergraphs

Journal of Physics: Complexity, 2023
Hypergraphs have emerged as a powerful modeling framework to represent systems with multiway interactions, that is systems where interactions may involve an arbitrary number of agents. Here we explore the properties of real-world hypergraphs, focusing on
Timothy LaRock, Renaud Lambiotte
doaj   +1 more source

Graph equations for line graphs and total graphs

Discrete Mathematics, 1975
AbstractAll pairs (G,H) of graphs G,H satisfying L(G) = T(H) are determined. The “graph equation“ L(G)= T(H) is also solved.
Dragos M. Cvetkovic, Slobodan K. Simic
openaire   +1 more source

The General Position Problem on Kneser Graphs and on Some Graph Operations

Discussiones Mathematicae Graph Theory, 2021
A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a geodesic between two other vertices of S. The cardinality of a largest general position set of G is the general position number (gp-number) gp(G) of G.
Ghorbani Modjtaba, Maimani Hamid Reza, Momeni Mostafa, Mahid Farhad Rahimi, Klavžar Sandi, Rus Gregor   +5 more
doaj   +1 more source

Some Properties of Regular Line Graphs

مجلة علوم ذي قار, 2019
In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj   +4 more sources

Old and new generalizations of line graphs

International Journal of Mathematics and Mathematical Sciences, 2004
Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except for K3 and K1,3.
Jay Bagga
doaj   +1 more source

Independent point-set domination in line graphs

AKCE International Journal of Graphs and Combinatorics, 2021
Line graph of a graph G is an intersection graph of the edge set E(G) of G. In this paper, we obtain a sharp upper bound on the diameter of graph G whose line graph is an ipsd graph (graph possessing an independent point-set dominating set) by ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj   +1 more source

Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs

Mathematics
The shortest path problem is fundamental in graph theory and has been studied extensively due to its practical importance. Despite this aspect, finding the shortest path between two nodes remains a significant challenge in many applications, as it often ...
Adrien Durand, Timothé Watteau, Georges Ghazi, Ruxandra Mihaela Botez   +3 more
doaj   +1 more source

Nonplanarity of Iterated Line Graphs

Journal of Mathematics, 2020
The 1-crossing index of a graph G is the smallest integer k such that the kth iterated line graph of G has crossing number greater than 1. In this paper, we show that the 1-crossing index of a graph is either infinite or it is at most 5.
Jing Wang
doaj   +1 more source

Closeness of Some Graph Operations

Computing Open
Closeness is an important measure of network centrality. In this paper, we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs.
Chavdar Dangalchev
doaj   +1 more source