Log in

Relevant bibliographies by topics / Inner vertex number / Journal articles

To see the other types of publications on this topic, follow the link: Inner vertex number.

Journal articles on the topic 'Inner vertex number'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 28 journal articles for your research on the topic 'Inner vertex number.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Amjadi, J. "The signed total Roman domatic number of a digraph." Discrete Mathematics, Algorithms and Applications 10, no. 02 (2018): 1850020. http://dx.doi.org/10.1142/s1793830918500209.

Full text

Abstract:

Let [Formula: see text] be a finite simple digraph with vertex set [Formula: see text]. A signed total Roman dominating function (STRDF) on a digraph [Formula: see text] is a function [Formula: see text] such that (i) [Formula: see text] for every [Formula: see text], where [Formula: see text] consists of all inner neighbors of [Formula: see text], and (ii) every vertex [Formula: see text] for which [Formula: see text] has an inner neighbor [Formula: see text] for which [Formula: see text]. The weight of an STRDF [Formula: see text] is [Formula: see text]. The signed total Roman domination num

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Haisheng. "Twisted Modules and Pseudo-endomorphisms." Algebra Colloquium 19, no. 02 (2012): 219–36. http://dx.doi.org/10.1142/s1005386712000156.

Full text

Abstract:

We exhibit a connection between two constructions of twisted modules for a general vertex operator algebra with respect to inner automorphisms. We also study pseudo-derivations, pseudo-endomorphisms, and twist deformations of ordinary modules by pseudo-endomorphisms.

APA, Harvard, Vancouver, ISO, and other styles

3

Zheng, Lina, Yiqiao Wang, and Weifan Wang. "The Difference of Zagreb Indices of Halin Graphs." Axioms 12, no. 5 (2023): 450. http://dx.doi.org/10.3390/axioms12050450.

Full text

Abstract:

The difference of Zagreb indices of a graph G is defined as ΔM(G)=∑u∈V(G)(d(u))2−∑uv∈E(G)d(u)d(v), where d(x) denotes the degree of a vertex x in G. A Halin graph G is a graph that results from a plane tree T without vertices of degree two and with at least one vertex of degree at least three such that all leaves are joined through a cycle C in the embedded order. In this paper, we establish both lower and upper bounds on the difference of Zagreb indices for general Halin graphs and some special Halin graphs with fewer inner vertices. Furthermore, extremal graphs attaining related bounds are f

APA, Harvard, Vancouver, ISO, and other styles

4

Bribiesca, Ernesto, Ulf-Dietrich Braumann, Angel Carrillo-Bermejo, and Humberto Sossa-Azuela. "An Approach to the Computation of the Euler Number by means of the Vertex Chain Code." Computational and Mathematical Methods in Medicine 2020 (July 16, 2020): 1–13. http://dx.doi.org/10.1155/2020/5632159.

Full text

Abstract:

We present an approach to compute the number of holes in binary images using the Vertex Chain Code (VCC); the VCC was developed for representing and analyzing 2D shapes composed of cells. Using this code, it is possible to relate the outer to inner vertices of any 2D shape and to find interesting properties. Now, in this paper, we describe more properties of the VCC, such as the computation of the connected regions in a hole, the analysis of complementary chains, the computation of the number of holes in a binary shape or image, the computation of the Euler number, and the detection of convex

APA, Harvard, Vancouver, ISO, and other styles

5

Dale, P. J., and M.-C. Nielsen. "Main characteristics to distinguish Bactericera cockerelli from other psyllids in New Zealand." New Zealand Plant Protection 62 (August 1, 2009): 411. http://dx.doi.org/10.30843/nzpp.2009.62.4862.

Full text

Abstract:

The tomato/potato psyllid Bactericera cockerelli (Sulc) (Hemiptera Triozidae) is found throughout most of New Zealand along with a range of native and other introduced psyllids all belonging to the superfamily Psylloidea The Psylloidea contains six families of which four are recorded from New Zealand (Psyllidae Calophyidae Homotomidae and Triozidae) Species belonging to Triozidae have trifurcate branching on the basal vein of the forewing in contrast to the other psyllid families in New Zealand which have bifurcate branching Bactericera cockerelli can be distinguished from other Triozidae spec

APA, Harvard, Vancouver, ISO, and other styles

6

Khabyah, Ali Al, and Moin A. Ansari. "Exploring Geometrical Properties of Annihilator Intersection Graph of Commutative Rings." Axioms 14, no. 5 (2025): 336. https://doi.org/10.3390/axioms14050336.

Full text

Abstract:

Let Λ denote a commutative ring with unity and D(Λ) denote a collection of all annihilating ideals from Λ. An annihilator intersection graph of Λ is represented by the notation AIG(Λ). This graph is not directed in nature, where the vertex set is represented by D(Λ)*. There is a connection in the form of an edge between two distinct vertices ς and ϱ in AIG(Λ) iff Ann(ςϱ)≠Ann(ς)∩Ann(ϱ). In this work, we begin by categorizing commutative rings Λ, which are finite in structure, so that AIG(Λ) forms a star graph/2-outerplanar graph, and we identify the inner vertex number of AIG(Λ). In addition, a

APA, Harvard, Vancouver, ISO, and other styles

7

RODRIGUES, F. A., G. TRAVIESO, and L. da F. COSTA. "FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH." International Journal of Modern Physics C 18, no. 06 (2007): 937–47. http://dx.doi.org/10.1142/s0129183107011042.

Full text

Abstract:

A new method for community identification is proposed which is founded on the analysis of successive neighborhoods, reached through hierarchical growth from a starting vertex, and on the definition of communities as a subgraph whose number of inner connections is larger than outer connections. In order to determine the precision and speed of the method, it is compared with one of the most popular community identification approaches, namely Girvan and Newman's algorithm. Although the hierarchical growth method is not as precise as Girvan and Newman's method, it is potentially faster than most c

APA, Harvard, Vancouver, ISO, and other styles

8

SIROTKIN, R. O., O. S. SIROTKIN, and A. M. PAVLOVA. "ON THE ‘DEGENERATION’ OF CHEMICAL BONDS WITHIN A UNIFIED MODEL AND SYSTEM COMBINING BASIC CLASSES OF CHEMICAL SUBSTANCES." Herald of Technological University 28, no. 5 (2025): 129–34. https://doi.org/10.55421/3034-4689_2025_28_5_129.

Full text

Abstract:

Based on a unified model of chemical bonding that combines its three extreme types (covalent, metallic, and ionic) in the form of mixed homo- and heteronuclear classes, for the first time within the system of chemical bonds and compounds (SCBC) in the form of a ‘chemical triangle,’ the boundary of their ‘degeneration’ has been determined, beyond which they cease to exist. Within this model, the ‘degeneration’ of a chemical bond occurs through the gradual transformation of an extremely covalent localised chemical bond into bonds mixed with its metallic or ionic varieties. As a result, there is

APA, Harvard, Vancouver, ISO, and other styles

9

Iqbal, Muhammad Azhar, Muhammad Imran, and Muhammad Asad Zaighum. "Eccentricity based topological indices of siloxane and POPAM dendrimers." Main Group Metal Chemistry 43, no. 1 (2020): 92–98. http://dx.doi.org/10.1515/mgmc-2020-0010.

Full text

Abstract:

AbstractA massive of early drug tests indicates that there is some strong inner connections among the bio-medical and pharmacology properties of nanostar dendrimers and their molecular structures. Topological descriptors are presented as fundamentally transforming a molecular graph into a number. There exist various categories of such descriptors particularly those descriptors that based on edge and vertex distances. Topological descriptors are exercised for designing biological, physico-chemical, toxicological, pharmacologic and other characteristics of chemical compounds. In this paper, we s

APA, Harvard, Vancouver, ISO, and other styles

10

Ou, Shikun, and Jin Zhong. "Automorphisms of a commuting graph of rank one upper triangular matrices." Electronic Journal of Linear Algebra 31 (February 5, 2016): 774–93. http://dx.doi.org/10.13001/1081-3810.3064.

Full text

Abstract:

Let $F$ be a finite field, $n\geqslant 2$ an arbitrary integer, $\mathcal{M}_n(F)$ the set of all $n\times n$ matrices over $F$, and $\mathcal{U}_n^1(F)$ the set of all rank one upper triangular matrices of order $n$. For $\mathcal{S}\subseteq\mathcal{M}_n(F)$, denote $C(\mathcal{S})=\{X\in \mathcal{S} |\ XA=AX \ \hbox{for all}\ A\in \mathcal{S}\}$. The commuting graph of $\mathcal{S}$, denoted by $\Gamma(\mathcal{S})$, is the simple undirected graph with vertex set $\mathcal{S}\setminus C(\mathcal{S})$ in which for every two distinct vertices $A$ and $B$, $A\sim B$ is an edge if and only if $

APA, Harvard, Vancouver, ISO, and other styles

11

Stas, Michal. "Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph." Filomat 34, no. 9 (2020): 2829–46. http://dx.doi.org/10.2298/fil2009829s.

Full text

Abstract:

The main aim of the paper is to give the crossing number of the join product G* + Dn for the connected graph G* of order six consisting of P4 + D1 and of one leaf incident with some inner vertex of the path P4 on four vertices, and where Dn consists of n isolated vertices. In the proofs, it will be extend the idea of the minimum numbers of crossings between two different subgraphs from the set of subgraphs which do not cross the edges of the graph G* onto the set of subgraphs by which the edges of G* are crossed exactly once. Due to the mentioned algebraic topological approach, we are able to

APA, Harvard, Vancouver, ISO, and other styles

12

Blidaru, B. M. "Testbeam performance results of bent ALPIDE monolithic active pixel sensors in view of the ALICE Inner Tracking System 3." Journal of Instrumentation 17, no. 09 (2022): C09006. http://dx.doi.org/10.1088/1748-0221/17/09/c09006.

Full text

Abstract:

Abstract The ALICE Inner Tracking System has been recently upgraded to a full silicon detector consisting entirely of monolithic active pixel sensors, arranged in seven concentric layers around the LHC beam pipe. Further ahead, during the LHC Long Shutdown 3, the ALICE collaboration is planning to replace the three innermost layers of this new ITS with a novel vertex detector. The proposed design features wafer-scale, ultra-thin, truly cylindrical MAPS. The new sensors will be thinned down to 20–40 µm, featuring a material budget of less than 0.05% x/X 0 per layer, unprecedented low, and will

APA, Harvard, Vancouver, ISO, and other styles

13

Kimmich, Nina, Vera Grauwiler, Anne Richter, Roland Zimmermann, and Martina Kreft. "Birth Lacerations in Different Genital Compartments and their Effect on Maternal Subjective Outcome: A Prospective Observational Study." Zeitschrift für Geburtshilfe und Neonatologie 223, no. 06 (2019): 359–68. http://dx.doi.org/10.1055/a-0858-0138.

Full text

Abstract:

Abstract Introduction Lacerations are common in vaginal births, but little is known about tears other than perineal tears and their association with maternal impairment. This study aimed to evaluate the frequency and distribution of birth lacerations and their association with maternal discomfort. Methods From 2/2015 to 12/2016, we conducted a prospective observational study on 140 women with singletons in vertex presentation at term, who gave birth vaginally in our center and were affected by a laceration. The lacerations were assigned objectively and subjectively to eight genital tract compa

APA, Harvard, Vancouver, ISO, and other styles

14

Chamani, Javad Ghareh, Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou, and Rasool Jalili. "GraphOS: Towards Oblivious Graph Processing." Proceedings of the VLDB Endowment 16, no. 13 (2023): 4324–38. http://dx.doi.org/10.14778/3625054.3625067.

Full text

Abstract:

We propose GraphOS, a system that allows a client that owns a graph database to outsource it to an untrusted server for storage and querying. It relies on doubly-oblivious primitives and trusted hardware to achieve a very strong privacy and efficiency notion which we call oblivious graph processing : the server learns nothing besides the number of graph vertexes and edges, and for each query its type and response size. At a technical level, GraphOS stores the graph on a doubly-oblivious data structure , so that all vertex/edge accesses are indistinguishable. For this purpose, we propose Omix++

APA, Harvard, Vancouver, ISO, and other styles

15

H., M. Nagesh, Chandrasekhar R., and C. Mahesh Kumar M. "Directed Pathos Block Line Cut-Vertex Digraph of an Arborescence." November 30, 2016. https://doi.org/10.5281/zenodo.826836.

Full text

Abstract:

The path number of a graph <em>G</em> is the number of paths in any pathos. The path number of a tree <em>T</em> equals<em> k</em>, where <em>2k</em> is the number of odd degree vertices of T Harary and Stanton calculated the path number of certain classes of graphs like trees and complete graphs.

APA, Harvard, Vancouver, ISO, and other styles

16

Long, Shude, and Han Ren. "Counting 2-Connected 4-Regular Maps on the Projective Plane." Electronic Journal of Combinatorics 21, no. 2 (2014). http://dx.doi.org/10.37236/4038.

Full text

Abstract:

In this paper the number of rooted (near-) 4-regular maps on the projective plane are investigated with respect to the root-valency, the number of edges, the number of inner faces, the number of nonroot-vertex-loops, the number of nonroot-vertex-blocks. As special cases, formulae for several types of rooted 4-regular maps such as 2-connected 4-regular projective planar maps, rooted 2-connected (connected) 4-regular projective planar maps without loops are also presented. Several known results on the number of 4-regular maps on the projective plane are also concluded. Finally, by use of Darboux

APA, Harvard, Vancouver, ISO, and other styles

17

Yang, Ruhao, Han Ye, Qi Wang, Yumin Liu, Wenjun Liu, and Zhenping Wu. "Complex Janus MoSSe Nanoscrolls Spontaneously Formed from Flat Nanoflakes: A Theoretical Exploration." Small Structures, January 28, 2025. https://doi.org/10.1002/sstr.202400587.

Full text

Abstract:

Janus transition metal dichalcogenide (TMD) monolayers with out‐of‐plane atomic asymmetry have been experimentally observed to scroll into unique 1D nanoscrolls with diverse complex structures, while the underlying mechanism has not been unveiled. In this work, the entire scrolling process of triangular and hexagonal MoSSe nanoflakes is successfully simulated based on molecular dynamics, demonstrating the formation of five distinct nanoscroll structures. From flat configuration, the nanoflakes are released along typical directions (including edge‐to‐vertex, vertex‐to‐vertex, and vertex‐to‐edge

APA, Harvard, Vancouver, ISO, and other styles

18

Haynes, Gerald, Catherine Park, Amanda Schaeffer, Jordan Webster, and Lon H. Mitchell. "Orthogonal Vector Coloring." Electronic Journal of Combinatorics 17, no. 1 (2010). http://dx.doi.org/10.37236/327.

Full text

Abstract:

A vector coloring of a graph is an assignment of a vector to each vertex where the presence or absence of an edge between two vertices dictates the value of the inner product of the corresponding vectors. In this paper, we obtain results on orthogonal vector coloring, where adjacent vertices must be assigned orthogonal vectors. We introduce two vector analogues of list coloring along with their chromatic numbers and characterize all graphs that have (vector) chromatic number two in each case.

APA, Harvard, Vancouver, ISO, and other styles

19

Lua Ngo and Jae-Ho Han. "Graph-based segmentation with homogeneous hue and texture vertices." Optica Applicata 51, no. 4 (2021). http://dx.doi.org/10.37190/oa210406.

Full text

Abstract:

This work presents an automated segmentation method, based on graph theory, which processes superpixels that exhibit spatially similarities in hue and texture pixel groups, rather than individual pixels. The graph shortest path includes a chain of neighboring superpixels which have minimal intensity changes. This method reduces graphics computational complexity because it provides large decreases in the number of vertices as the superpixel size increases. For the starting vertex prediction, the boundary pixel in first column which is included in this starting vertex is predicted by a trained d

APA, Harvard, Vancouver, ISO, and other styles

20

Schüßler, Vincent, Johannes Hanika, and Carsten Dachsbacher. "Bridge Sampling for Connections via Multiple Scattering Events." Computer Graphics Forum 43, no. 4 (2024). http://dx.doi.org/10.1111/cgf.15160.

Full text

Abstract:

AbstractExplicit sampling of and connecting to light sources is often essential for reducing variance in Monte Carlo rendering. In dense, forward‐scattering participating media, its benefit declines, as significant transport happens over longer multiple‐scattering paths around the straight connection to the light. Sampling these paths is challenging, as their contribution is shaped by the product of reciprocal squared distance terms and the phase functions. Previous work demonstrates that sampling several of these terms jointly is crucial. However, these methods are tied to low‐order scatterin

APA, Harvard, Vancouver, ISO, and other styles

21

F. Pylypaka, S., and A. V. Nesvidomin. "Finding the trajectories of the movement of a material particle on the inner surface of a cone with a vertical axis with lateral feed of the material." Energy and automation, December 20, 2024, 77–92. https://doi.org/10.31548/energiya5(75).2024.077.

Full text

Abstract:

The movement of material particles along the inner surface of the cone takes place in cyclones, the designs of which can have both cylindrical and conical parts. Aerodynamic processes occurring in a cyclone are complex in nature, therefore they cannot be accurately modeled on the basis of theoretical approaches. A number of simplifications were introduced during the research: air resistance is not taken into account, since the particle is fed into the cone together with the air, although later their directions of movement do not coincide (the particle damps the speed and falls down, and the ai

APA, Harvard, Vancouver, ISO, and other styles

22

Zarei, Mehdi, and Gholam Hossein Rahimi. "External pressure buckling of composite sandwich conical shells with variable skin thickness." Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering, July 20, 2022, 095441002211017. http://dx.doi.org/10.1177/09544100221101764.

Full text

Abstract:

In this paper, an analytical model is developed to investigate the buckling analysis of the composite sandwich conical shell with variable skin thickness under lateral pressure loading. This problem involves composite shells, which are produced during the filament-winding process, where the skin thickness varies through the length of the shell. An effective smeared method is employed to reduce the reinforced lattice core into a layer. This is done by analyzing forces and moments on a unit cell. Therefore, equivalent stiffness parameters of reinforced lattice core are determined. By superimposi

APA, Harvard, Vancouver, ISO, and other styles

23

Yılmaz, Cengizhan, Murat Kabak, and Sedef Selviler Sizer. "Comparative macroanatomical and scanning electron microscopy study of the eyeball in brachycephalic and mesocephalic dog breeds." Microscopy Research and Technique, June 2024. http://dx.doi.org/10.1002/jemt.24624.

Full text

Abstract:

AbstractThe anatomical structures forming the eyeball differ among dog breeds, both morphologically and morphometrically. This study was aimed at determining the morphometric values of the eyeball layers of different dog breeds and the morphological structures of these layers using scanning electron microscopy. Thirty‐two eyeballs of 17 dogs belonging to 9 different breeds that died from traffic accidents, falling from a height, and naturally were used. These dog breeds were grouped according to their brachycephalic and mesocephalic skull structures, and morphometric measurements of the eyebal

APA, Harvard, Vancouver, ISO, and other styles

24

Khalid, Asad, and S. M. Rohaizan. "Performance of tri-tubular conical energy absorber under axial compression." Journal of Mechanical Engineering and Sciences, March 30, 2024, 9872–82. http://dx.doi.org/10.15282/jmes.18.1.2024.6.0781.

Full text

Abstract:

Quasi static axial compression loading on tri-tubular cone (TC) has been carried out using LS-DYNA finite element analysis method. Tri-tubular cones of three arrangements; the first arrangement (model TC-1) consists of cone heights of 50 mm, 75 mm and 100 mm where the inner cone is the maximum height. The second arrangement (model TC-2) consists of cone heights of 100 mm, 75 mm, and 50 mm where the outer cone is the maximum height. The third arrangement (model TC-3) consists of three cones of the same height of 100 mm. Cone semi vertex angle of 20o was maintained for all tri-tubular cones test

APA, Harvard, Vancouver, ISO, and other styles

25

Zhang, Muhan, Zhicheng Cui, Shali Jiang, and Yixin Chen. "Beyond Link Prediction: Predicting Hyperlinks in Adjacency Space." Proceedings of the AAAI Conference on Artificial Intelligence 32, no. 1 (2018). http://dx.doi.org/10.1609/aaai.v32i1.11780.

Full text

Abstract:

This paper addresses the hyperlink prediction problem in hypernetworks. Different from the traditional link prediction problem where only pairwise relations are considered as links, our task here is to predict the linkage of multiple nodes, i.e., hyperlink. Each hyperlink is a set of an arbitrary number of nodes which together form a multiway relationship. Hyperlink prediction is challenging---since the cardinality of a hyperlink is variable, existing classifiers based on a fixed number of input features become infeasible. Heuristic methods, such as the common neighbors and Katz index, do not

APA, Harvard, Vancouver, ISO, and other styles

26

Holod, Monique, Anna McCormick, and Samantha de los Reyes. "Association of race and ethnicity in cesarean rates in a diverse low-risk populationAssociation of race and ethnicity in cesarean rates in a diverse low-risk population." HPHR Journal, no. 85 (2024). http://dx.doi.org/10.54111/0001/gggg4.

Full text

Abstract:

Objective To evaluate racial disparities in cesarean delivery rates in an ethnically diverse nulliparous, term, singleton, vertex (NTSV) population at an inner-city tertiary care center. Methods This is a retrospective cohort study evaluating cesarean delivery rates by race and ethnicity in an ethnically diverse NTSV population with approximately equal numbers of Hispanic, non-Hispanic Black and non-Hispanic White participants from January 1st through December 31st, 2020. The primary outcome was cesarean delivery rate. The secondary outcome was urgency of cesarean delivery categorized as emerg

APA, Harvard, Vancouver, ISO, and other styles

27

ISMAIL, HEBA M., DAVID D. CUTHBERTSON, ANANTA ADDALA, et al. "1525-P: Genetic Ancestry and Progression through Type 1 Diabetes (T1D) Stages." Diabetes 74, Supplement_1 (2025). https://doi.org/10.2337/db25-1525-p.

Full text

Abstract:

Introduction and Objective: Race/ethnicity is a social construct affecting T1D risk while genetic ancestry (GA) (a biological factor) is understudied. Here, we examined if GA is related to autoantibody (Ab) and metabolic patterns in those at risk for T1D. Methods: We studied relatives of people with T1D in the TrialNet Pathway to Prevention study and classified them using GRAF-pop, a distance-based method to infer GA groups, into European (E), African American (AA), Latin American 1 (LA1), Latin American 2 (LA2), South Asian (SA), and Asian-Pacific Islander (API). We compared GA groups for Ab

APA, Harvard, Vancouver, ISO, and other styles

28

Gai, Guodong, and Anthony Wachs. "On the streamwise vorticity generation and distribution in an angular particle wake." Journal of Fluid Mechanics 964 (June 7, 2023). http://dx.doi.org/10.1017/jfm.2023.408.

Full text

Abstract:

We investigate the streamwise vorticity generation mechanism and distribution pattern in an unbounded steady inertial flow past a fixed Platonic polyhedron. Three angular positions are selected: an edge facing the flow (E), a face facing the flow (F) and a vertex facing the flow (V). We provide compelling evidence that the generation of the streamwise vorticity is primarily caused by the tilting of the transverse vorticity that originates from the particle front surface. Each inclined face on the front surface generates a pair of opposite-signed streamwise vortices. They are advected to the pa

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!