Mixed graphs with maximum number of vertices regarding to a given maximum degree and
given diameter are known as mixed Moore graphs. In this paper we model the problem of …

A Note on Graphs with Zero Nullity Introduction and Preliminaries Page 1 A Note on Graphs
with Zero Nullity Firouzeh Ashraf a∗ Hamidreza Bamdad b† aDepartment of Mathematics …

A natural upper bound for the maximum number of vertices in a mixed graph with maximum
undirected degree r, maximum directed out-degree z and diameter k is given by the mixed …

An algorithm for finding complementary nil dominating set in a fuzzy graph Page 1 NTMSCI 5,
No. 3, 1-6 (2017) 1 New Trends in Mathematical Sciences http://dx.doi.org/10.20852/ntmsci.2017.179 …

Undirected T-graphs (sometimes called strongly geodetic graphs) have been studied in
several papers [3, 7, 13]. Plesnik and Znam [14] have dealt with analogous problems for …

be from any type of computer printer. Page 1 INFORMATION TO USERS This manuscript has
been reproduced from the microfilm master. UMI films the text directly from the original or copy …

Let G be a symmetric connected graph without loops. Denote by b (G) the maximum number
of edges in a bipartite subgraph of G. Determination of b (G) is polynomial for planar graphs …

Consider the family of all finite graphs with maximum degree Δ (G)< d and matching number
ν (G)< m. In this paper we give a new proof to obtain the exact upper bound for the number …

My Favorite Theorem: Characterizations of Perfect Graphs Page 1 Takustraße 7 D-14195
Berlin-Dahlem Germany Konrad-Zuse-Zentrum fur Informationstechnik Berlin MARTIN GR …

In this paper, we consider upper bound graphs and double bound graphs of posets. We
obtain a characterization of upper bound graphs whose complements are also upper bound …