Results 171 to 180 of about 42,191 (216)

Risk factors for combined vaginal-cesarean delivery in the vertex-vertex twins: a case-control study. [PDF]

Arch Gynecol Obstet
Manor I, Gabbai D, Baruch Y, Yogev Y, Hiersch L, Attali E.   +5 more
europepmc   +1 more source

Chemical significance and degeneracy of weighted degree-based topological descriptor second Davan index for octane isomers and computation of certain nanostructures. [PDF]

Sci Rep
Swapna BS, Chetana G, Shanmukha MC, Manjunath G, Usha A.   +4 more
europepmc   +1 more source

Effortful Control and Cortical Brain Structure in 5-Year-Old Children: Findings From the FinnBrain Birth Cohort Study. [PDF]

Eur J Neurosci
Frantti M, Tuulari JJ, Nolvi S, Nordenswan E, Copeland A, Kumpulainen V, Silver E, Merisaari H, Saukko E, Kataja EL, Korja R, Karlsson L, Karlsson H, Pulli EP.   +13 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the vertex degree function of graphs

Computational and Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Ch Das, Das Kinkar Chandra
exaly   +3 more sources

Vertex Arboricity and Vertex Degrees

Graphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Douglas Bauer, Aori Nevo, Edward F. Schmeichel   +2 more
openaire   +1 more source

On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion

Algorithmica, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann   +4 more
openaire   +3 more sources

Degree sum and vertex dominating paths

Journal of Graph Theory, 2018
AbstractA 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 R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson   +4 more
openaire   +2 more sources

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion

2011
For 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, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann   +3 more
openaire   +1 more source

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