Results 221 to 230 of about 41,896 (267)
Some of the next articles are maybe not open access.
Five-vertex degree graphs of nonsolvable groups
Journal of Pure and Applied Algebra, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aziziheris, Kamal, Mohammadzadeh, Amineh
openaire +1 more source
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
Algorithmica, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Betzler, Nadja +4 more
openaire +3 more sources
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
Vertex-degree based topological indices of digraphs
Discrete Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Monsalve, Juan Rada
openaire +1 more source
The vertex degree polynomial of some graph operations
2023Summary: 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
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-based topological indices of oriented trees
Applied Mathematics and Computation, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Bermudo, Roberto Cruz, Juan Rada
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
On vertex transitive graphs of infinite degree
Archiv der Mathematik, 1993A graph \(X\) is said to be shuffled by a subgroup \(G\) of its automorphism group \(\Aut(X)\) if for every infinite \(C \subseteq V(X)\) with finite boundary \(\partial C\) and every finite \(F \subseteq V(X)\), there exists \(\sigma \in G\) such that \(\sigma (F) \subseteq C\).
Diestel, R., Jung, H. A., Möller, R. G.
openaire +2 more sources
Note on vertex degrees of planar graphs
Journal of Graph Theory, 1984Let \(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