Results 271 to 280 of about 21,234 (294)
Some of the next articles are maybe not open access.

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   +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İ   +3 more
openaire   +2 more sources

The maximum degree in a vertex-magic graph [PDF]

open access: possibleAustralas. 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   +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   +2 more sources

Parameterized Graph Editing with Chosen Vertex Degrees

2008
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most kelementary editing operations; the operations are vertex deletion, edge deletion, and edge addition. We also consider more general annotated variants of this problem, where vertices and edges are assigned an integer cost ...
Luke Mathieson, Stefan Szeider
openaire   +1 more source

Vertex degrees in planar graphs

1993
Douglas B. West, Tood Will
openaire   +1 more source

Bounds for the largest and the smallest A eigenvalues of a graph in terms of vertex degrees

Linear Algebra and Its Applications, 2020
Sai Wang, Dein Wong, Fenglei Tian
exaly  

Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges

Journal of Mathematical Chemistry, 2009
Damir Vukicevic   +2 more
exaly  

On the degrees of E-super vertex-magic graphs

Electronic Notes in Discrete Mathematics, 2015
G Kumar, G Marimuthu
exaly  

Home - About - Disclaimer - Privacy