Results 311 to 320 of about 3,967,804 (356)
Some of the next articles are maybe not open access.
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs
Information Processing Letters, 2022zbMATH 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, 2017Summary: 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 +2 more
openaire +2 more sources
Distance degrees of vertex-transitive graphs
Graphs and Combinatorics, 1989In [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
2017Summary: 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
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
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 ComputationzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiaqi Li, Yi Zhang
openaire +2 more sources
Hypergraph recovery algorithms from a given vector of vertex degrees
Journal of computer & systems sciences international, 2014D. S. Kostyanoi +2 more
semanticscholar +1 more source
Vertex degrees and doubly stochastic graph matrices
Journal of Graph Theory, 2011Xiaodong Zhang
semanticscholar +1 more source

