Relevant bibliographies by topics / Inner vertex number

Contents

  1. Journal articles
  2. Book chapters
  3. Conference papers

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Inner vertex number"

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
More sources

Book chapters on the topic "Inner vertex number"

1

Goel, Akshit, Sanmukh R. Kuppannagari, Yang Yang, Ajitesh Srivastava, and Viktor K. Prasanna. "Parallel Totally Induced Edge Sampling on FPGAs1." In Parallel Computing: Technology Trends. IOS Press, 2020. http://dx.doi.org/10.3233/apc200097.

Full text
Abstract:
Graphs are a powerful tool for data representation in a wide range of domains like social, biological, informational, etc. But their extremely large sizes often makes it computationally infeasible to study the entire graphs. Graph sampling provides a solution by generating smaller subgraphs which are computationally feasible to analyze and can be used to infer the properties of the entire graph. In this work, we develop a high throughput parallel implementation of Totally Induced Edge Sampling (TIES) algorithm on FPGA. Prior research has shown that TIES performs better than other sampling tech
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Inner vertex number"

1

Parbat, Sarwesh, Zheng Min, Li Yang, and Minking Chyu. "Experimental and Numerical Analysis of Additively Manufactured Inconel 718 Coupons With Lattice Structure." In ASME Turbo Expo 2019: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/gt2019-91949.

Full text
Abstract:
Abstract In the present paper, lattice geometries have been developed and tested for application in internal cooling of gas turbine blades. These geometries are suitable for embedding within a near surface or double wall cooling configuration. Two types of unit cells with variation in number of ligaments and porosity, were used to generate two lattice configurations. The first type of unit cell consisted of six ligaments of 0.5 mm diameter joined at a common vertex situated at the middle. As such, three ligaments were located on each side of the common middle vertex. In addition, the top half
APA, Harvard, Vancouver, ISO, and other styles
2

Bozzi, Luca, Enrico D’Angelo, Bruno Facchini, Mirko Micio, and Riccardo Da Soghe. "Experimental Investigation on Leakage Losses and Heat Transfer in a Non Conventional Labyrinth Seal." In ASME 2011 Turbo Expo: Turbine Technical Conference and Exposition. ASMEDC, 2011. http://dx.doi.org/10.1115/gt2011-46362.

Full text
Abstract:
Different labyrinth seal configurations are used in modern heavy-duty gas turbine such as see-through stepped or honeycomb seals. The characterization of leakage flow through the seals is one of the main tasks for secondary air system designers as well as the evaluation of increase in temperature due to heat transfer and windage effects. In high temperature turbomachinery applications, knowledge of the heat transfer characteristics of flow leaking through the seals is needed in order to accurately predict seal dimensions and performance as affected by thermal expansion. This paper deals with t
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Peng-Yu, Wei-Hui Chen, and Che-Wun Hong. "Nanofludic Analysis on Methanol Crossover of Direct Methanol Fuel Cells." In ASME 2008 First International Conference on Micro/Nanoscale Heat Transfer. ASMEDC, 2008. http://dx.doi.org/10.1115/mnht2008-52095.

Full text
Abstract:
Direct methanol fuel cells (DMFCs) are considered as a competitive power source candidate for portable electronic devices. Nafion® has been widely used for the electrolyte of DMFCs because of its good proton conductivity and high chemical and mechanical stability. However, the major problem that must be solved before commercialization is the high methanol crossover through the membrane. There are a number of studies on experiments about the methanol crossover rate through the membrane but only few theoretical investigations have been presented [1–3]. In this paper, an atomistic model [4] is pr
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Inner vertex number' for particular source types:
Journal articles
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!

To the bibliography