Non-constant continuous mappings of metric or compact Hausdorff spaces
Noncrossing trees and noncrossing graphs.
Nonderogatory directed windmills.
Nonderogatory unicyclic digraphs.
Nonempty intersection of longest paths in a graph with a small matching number
A maximum matching of a graph is a matching of with the largest number of edges. The matching number of a graph , denoted by , is the number of edges in a maximum matching of . In 1966, Gallai conjectured that all the longest paths of a connected graph have a common vertex. Although this conjecture has been disproved, finding some nice classes of graphs that support this conjecture is still very meaningful and interesting. In this short note, we prove that Gallai’s conjecture is true for...
Nonexistence of almost Moore digraphs of diameter three.
Nonexistence of graphs with cyclic defect.
Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected -graphs.
Non-Hamiltonian Square-minus-two.
Non-hyperbolicity in random regular graphs and their traffic characteristics
In this paper we prove that random d-regular graphs with d ≥ 3 have traffic congestion of the order O(n logd−13 n) where n is the number of nodes and geodesic routing is used. We also show that these graphs are not asymptotically δ-hyperbolic for any non-negative δ almost surely as n → ∞.
Non-isomorphic graphs with cospectral symmetric powers.
Non-orientable biembeddings of Steiner triple systems of order 15.
Nonorientable Genus of Nearly Complete Bipartite Graphs.
Non-planar network with edges subject to failure and enumeration of proper cuts
Non-repetitive 3-coloring of subdivided graphs.
Nonrepetitive colorings of graphs -- a survey.
Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most three Laplacian eigenvalues greater than two.
Non-surjective linear transformations of tropical matrices preserving the cyclicity index
The cyclicity index of a matrix is the cyclicity index of its critical subgraph, namely, the subgraph of the adjacency graph which consists of all cycles of the maximal average weight. The cyclicity index of a graph is the least common multiple of the cyclicity indices of all its maximal strongly connected subgraphs, and the cyclicity index of a strongly connected graph is the least common divisor of the lengths of its (directed) cycles. In this paper we obtain the characterization of linear, possibly...
Nordhaus-Gaddum results for weakly convex domination number of a graph
Nordhaus-Gaddum results for weakly convex domination number of a graph G are studied.
Nordhaus-gaddum-type relations for the energy and Laplacian energy of graphs