Results 231 to 240 of about 45,382 (265)

The vertex degrees of minimum spanning trees

European Journal of Operational Research, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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

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

Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−2

Discrete Mathematics, Algorithms and Applications, 2016
A vertex-deleted subgraph of a graph [Formula: see text] is called a card of [Formula: see text] A card of [Formula: see text] with which the degree of the deleted vertex is also given is called a degree associated card (or dacard) of [Formula: see text] The degree associated reconstruction number (or drn) of a graph [Formula: see text] is the size of
A. Anu, S. Monikandan
openaire   +2 more sources

Splice graphs and their vertex-degree-based invariants

2017
Summary: Let \(G_1\) and \(G_2\) be simple connected graphs with disjoint vertex sets \(V(G_1)\) and \(V(G_2)\), respectively. For given vertices \(a_1 \in V(G_1)\) and \(a_2 \in V(G_2)\), a splice of \(G_1\) and \(G_2\) by vertices \(a_1\) and \(a_2\) is defined by identifying the vertices \(a_1\) and \(a_2\) in the union of \(G_1\) and \(G_2\).
Azari, M., Falahati-Nezhad, F.
openaire   +1 more source

Vertex degree sums for supereulerian bipartite digraphs

Applied Mathematics and Computation
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiaqi Li, Yi Zhang 0114
openaire   +3 more sources

The maximum degree in a vertex-magic graph

Australas. J Comb., 2004
Let \(G\) be a vertex-magic graph with \(v\) vertices, \(e\) edges and \(c\) components. In the paper it is proved that the maximum degree \(\Delta\) of \(G\) satisfies \(\Delta\leq \sqrt{(7e^2+(6c+5)e+c^2+3c)/v}-2\).
openaire   +2 more sources

Vertex Degrees

2023
openaire   +1 more source

Extremal Graphs to Vertex Degree Function Index for Convex Functions

Axioms, 2023
Kinkar Chandra Das, Chenxu Yang, Zhen Ji
exaly  

On the Parameterized Complexity of Minimum/Maximum Degree Vertex Deletion on Several Special Graphs

Frontiers of Computer Science, 2023
Yongjie Yang
exaly