Results 221 to 230 of about 18,692 (262)
Link Prediction in Heterogeneous Information Networks: Improved Hypergraph Convolution with Adaptive Soft Voting. [PDF]
Entropy (Basel)Zhang S +6 more
europepmc +1 more source
Efficient algorithm on exponential Wiener index and QSPR analysis of alkanes and benzenoid hydrocarbons. [PDF]
Sci RepPunitha S, Kannan K, Menaga A.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Vertex Arboricity and Vertex Degrees
Graphs and Combinatorics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bauer, D., Nevo, A., Schmeichel, E.
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
Degree sum and vertex dominating paths
Journal of Graph Theory, 2018AbstractA vertex dominating path in a graph is a path P such that every vertex outside P has a neighbor on P. In 1988 H. Broersma [5] stated a result implying that every n‐vertex k‐connected graph G such that contains a vertex dominating path. We provide a short, self‐contained proof of this result and further show that every n‐vertex k‐connected ...
Jill Faudree +4 more
openaire +2 more sources
Trees with Maximum Vertex-Degree-Based Topological Indices
Match Communications in Mathematical and in Computer Chemistry, 2022Summary: Let \(G\) be a graph with vertex set \(V(G)=\{v_1,v_2,\dots,v_n\}\) and edge set \(E(G)\), and \(d(v_i)\) be the degree of the vertex \(v_i\). The definition of a vertex-degree-based topological index of \(G\) is as follows \[ \mathcal{T}_f=\mathcal{T}_f(G)=\sum\limits_{v_iv_j\in E(G)}f(d(v_i),d(v_j)), \] where \(f(x,y)>0\) is a symmetric real
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
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
2011For directed and undirected graphs, we study the problem to make a distinguished vertex the unique minimum-(in) degree vertex through deletion of a minimum number of vertices. The corresponding NP-hard optimization problems are motivated by applications concerning control in elections and social network analysis.
Nadja Betzler +3 more
openaire +1 more source
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