Results 261 to 270 of about 21,234 (294)

Vertex Degrees

, 2015
Michal Karonski, Alan Frieze
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

TYPICAL VERTEX DEGREES

2003
exaly   +2 more sources

Degree sum and vertex dominating paths

Journal of Graph Theory, 2018
AbstractA vertex dominating path in a graph is a path P such that every vertex outside P has a neighbor on P. In 1988 H. Broersma [5] stated a result implying that every n‐vertex k‐connected graph G such that contains a vertex dominating path. We provide a short, self‐contained proof of this result and further show that every n‐vertex k‐connected ...
Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson   +4 more
openaire   +2 more sources

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion

2011
For directed and undirected graphs, we study the problem to make a distinguished vertex the unique minimum-(in) degree vertex through deletion of a minimum number of vertices. The corresponding NP-hard optimization problems are motivated by applications concerning control in elections and social network analysis.
Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann   +3 more
openaire   +1 more source

COMPUTATION OF VERTEX DEGREE ENERGY OF A GRAPH

Advances and Applications in Discrete Mathematics, 2017
Summary: Using Huckel molecular orbital (HMO) theory of total \(\pi\)-electron energy, \textit{I. Gutman} [Ber. Math.-Stat. Sekt. Forschungszent. Graz 103, 22 S. (1978; Zbl 0402.05040)] conceived the idea of energy of a graph with the help of adjacency matrix. Adjacent atoms may or may not have same degree.
Kanna, M. R. Rajesh, Sridhara, G., Jagadeesh, R.   +2 more
openaire   +2 more sources

Distribution of Vertex Degree in Web-Graphs

Combinatorics, Probability and Computing, 2006
We give results for the age-dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process introduced in [8]. For such processes we show that as $k \rightarrow \infty$, the expected proportion of vertices of degree $k$ has power law parameter $1+1/\eta$ where $\eta$ is
openaire   +2 more sources

Distance degrees of vertex-transitive graphs

Graphs and Combinatorics, 1989
In [4], a lower bound of distance degrees of distance degree regular graphs is obtained. In this paper, we prove that a lower bound will be improved in some cases of vertex-transitive graphs.
openaire   +1 more source

On the vertex degree function of graphs

Computational and Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Note on vertex degrees of planar graphs

Journal of Graph Theory, 1984
Let \(d_ 1,...,d_ 2\) denote the degree sequence of a graph, and let \(M_ 2=\sum^{n}_{i=1}d^ 2_ i.\) The author shows that if G is an outerplanar graph of order \(n\geq 3\) then \(M_ 2\leq n^ 2+7n-18.\) Also if G is a planar graph of order \(n\geq 4\) then \(M_ 2\leq 2n^ 2+12n-44.\) These results are proved by induction on n.
openaire   +2 more sources

The vertex degrees of minimum spanning trees

European Journal of Operational Research, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source