AbstractIn this paper, the lower bounds of maximum genera of simplicial graphs under the constraints of girth and connectivity are discussed extensively. A complete picture on the lower bounds of maximum genera of graphs is formed. There are infinitely many graphs with the maximum genera attaining these lower bounds
AbstractRecently, some sufficient conditions for a digraph to have maximum connectivity or high supe...
We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
AbstractIn this paper, the lower bounds on the maximum genus of a simple graph in terms of its conne...
AbstractIn this paper, the lower bounds of maximum genera of simplicial graphs under the constraints...
AbstractIt is shown that ⌈β(G)/3⌉ is the tight lower bound on the maximum genus γM(G) of 2-edge-conn...
AbstractIn this paper, a lower bound on the maximum genus of a graph in terms of its girth is establ...
AbstractIt is proved that every connected simplicial graph with minimum valence at least three has m...
AbstractIn this paper, the lower bounds on the maximum genus of a simple graph in terms of its conne...
AbstractThis paper is devoted to the lower bounds on the maximum genus of graphs. A simple statement...
AbstractLower bounds on the cardinality of the maximum matchings of graphs are established in terms ...
AbstractWe find an upper bound on the algebraic connectivity of graphs of various genus. We begin by...
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
AbstractLet G be a finite, connected graph with no loops or multiple edges. If G is the union of two...
AbstractRecently, some sufficient conditions for a digraph to have maximum connectivity or high supe...
We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
AbstractIn this paper, the lower bounds on the maximum genus of a simple graph in terms of its conne...
AbstractIn this paper, the lower bounds of maximum genera of simplicial graphs under the constraints...
AbstractIt is shown that ⌈β(G)/3⌉ is the tight lower bound on the maximum genus γM(G) of 2-edge-conn...
AbstractIn this paper, a lower bound on the maximum genus of a graph in terms of its girth is establ...
AbstractIt is proved that every connected simplicial graph with minimum valence at least three has m...
AbstractIn this paper, the lower bounds on the maximum genus of a simple graph in terms of its conne...
AbstractThis paper is devoted to the lower bounds on the maximum genus of graphs. A simple statement...
AbstractLower bounds on the cardinality of the maximum matchings of graphs are established in terms ...
AbstractWe find an upper bound on the algebraic connectivity of graphs of various genus. We begin by...
summary:In this paper we determine the maximum genus of a graph by using the matching number of the ...
In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n verti...
AbstractLet G be a finite, connected graph with no loops or multiple edges. If G is the union of two...
AbstractRecently, some sufficient conditions for a digraph to have maximum connectivity or high supe...
We find an upper bound on the algebraic connectivity of graphs of various genus. We begin by showing...
AbstractA lower bound for the number of maximum genus orientable embeddings of almost all graphs is ...
DOI
Add to ORKG