Results 231 to 240 of about 18,692 (262)

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

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

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
Anu, A., Monikandan, S.
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
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

Vertex Degrees

2023
openaire   +1 more source

f-Graph: Bounded Vertex Degree

2020
Louis V. Quintas, Edgar G. DuCasse
openaire   +1 more source

Vertex-degree function index on tournaments

2023
Rada, Juan, Cruz, Roberto, Bermudo, Sergio   +2 more
openaire   +1 more source

Minimum Vertex Dominating Set Algorithm Using Maximum Degree Vertex Adjacent to Minimum Degree Vertex Selection Method

Korea Institute of Information Technology Review, 2013
openaire   +1 more source