Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …

Interval graphs represent vertices as intervals on the real line, with edges denoting
overlap** intervals, while proper interval graphs prevent one interval from being fully …

Obviously, there are countless digraph classes, so that any attempt to give a complete
overview is doomed to failure. One has to restrict oneself to a selection. This chapter tries to …

This paper investigates unit disk graphs within the frameworks of fuzzy and neutrosophic
graphs, expanding upon the traditional study of intersection graphs. Unit disk graphs are …

Let D be a connected weighted digraph. The relation between the vertex-weighted
complexity (with a fixed root) of the line digraph of D and the edge-weighted complexity (with …

For any simple digraph $ D $ we offer a new proof for the intersection number of its middle
digraph, $ M (D) $; while doing so we also solve for the intersection number when $ D $ has …

A great deal of research has been done in the area of transformations on graphs and
digraphs, found in connection with work done in groups on graphs. We will deal with 4 …