Results 241 to 250 of about 309,095 (284)

Smoothing Vertex-degree Bounded Polyhedra

, 1993
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Vertex Arboricity and Vertex Degrees

Graphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bauer, D., Nevo, A., Schmeichel, E.
openaire   +1 more source

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

Algorithmica, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Betzler, Nadja, Bodlaender, Hans L., Bredereck, Robert, Niedermeier, Rolf, Uhlmann, Johannes   +4 more
openaire   +3 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 Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson   +4 more
openaire   +2 more sources

Trees with Maximum Vertex-Degree-Based Topological Indices

Match Communications in Mathematical and in Computer Chemistry, 2022
Summary: Let \(G\) be a graph with vertex set \(V(G)=\{v_1,v_2,\dots,v_n\}\) and edge set \(E(G)\), and \(d(v_i)\) be the degree of the vertex \(v_i\). The definition of a vertex-degree-based topological index of \(G\) is as follows \[ \mathcal{T}_f=\mathcal{T}_f(G)=\sum\limits_{v_iv_j\in E(G)}f(d(v_i),d(v_j)), \] where \(f(x,y)>0\) is a symmetric real
openaire   +1 more source

The vertex degree polynomial of some graph operations

2023
Summary: Graph polynomials have been developed for measuring structural information of networks using combinatorial graph invariants and for characterizing graphs. Various problems in graph theory and discrete mathematics can be treated and solved in a rather efficient manner by making use of polynomials.
CANGÜL, İSMAİL NACİ, Salestina, Ruby M., Alwardi, Anwar, Ahmed, Hanan   +3 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

Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs

Information Processing Letters, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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

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