Log in

Relevant bibliographies by topics / BOUNDARY VERTICES

Contents

Journal articles

Academic literature on the topic 'BOUNDARY VERTICES'

Author: Grafiati

Published: 11 September 2023

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 'BOUNDARY VERTICES.'

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 "BOUNDARY VERTICES"

1

Chartrand, Gary, David Erwin, Garry L. Johns, and Ping Zhang. "Boundary vertices in graphs." Discrete Mathematics 263, no. 1-3 (2003): 25–34. http://dx.doi.org/10.1016/s0012-365x(02)00567-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mariumuthu, G., and M. S. Saraswathy. "Dynamics of Boundary Graphs." Journal of Scientific Research 5, no. 3 (2013): 447–55. http://dx.doi.org/10.3329/jsr.v5i3.14866.

Full text

Abstract:

In a graph G, the distance d(u,v) between a pair of vertices u and v is the length of a shortest path joining them. A vertex v is a boundary vertex of a vertex u if for all The boundary graph B(G) based on a connected graph G is a simple graph which has the vertex set as in G. Two vertices u and v are adjacent in B(G) if either u is a boundary of v or v is a boundary of u. If G is disconnected, then each vertex in a component is adjacent to all other vertices in the other components and is adjacent to all of its boundary vertices within the component. Given a positive integer m, the mth iterated boundary graph of G is defined as A graph G is periodic if for some m. A graph G is said to be an eventually periodic graph if there exist positive integers m and k >0 such that We give the necessary and sufficient condition for a graph to be eventually periodic. Keywords: Boundary graph; Periodic graph. © 2013 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved. doi: http://dx.doi.org/10.3329/jsr.v5i3.14866 J. Sci. Res. 5 (3), xxx-xxx (2013)

APA, Harvard, Vancouver, ISO, and other styles

3

Cáceres, José, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María L. Puertas, and Carlos Seara. "On geodetic sets formed by boundary vertices." Discrete Mathematics 306, no. 2 (2006): 188–98. http://dx.doi.org/10.1016/j.disc.2005.12.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Li, Tao, and Wen Liang Chen. "A Robust Clipping Algorithm for Overlap Surface Patches." Applied Mechanics and Materials 701-702 (December 2014): 136–40. http://dx.doi.org/10.4028/www.scientific.net/amm.701-702.136.

Full text

Abstract:

By revising geometry and topology information of boundaries, a robust clipping method is proposed for overlapped surface patches. All the boundary vertices of one patch are marked on the basis of their relationship with the boundary loops of the other patch. Then the overlap regions are recognized according to the vertices flags. If the overlap regions are slim and only one boundary curve in each patch is intersected, the corresponding parts of the curves are subdivided and their vertices are repositioned, and the interfered curves are sewed together. Otherwise, the boundaries are reorganized according to vertex flags. There are two candidate clipping schemes for each overlapped patches and the one with fewer boundary curves is the final result. Examples verify robustness of the algorithms.

APA, Harvard, Vancouver, ISO, and other styles

5

Boyarsky, Alexey, Bogdan Kulik, and Oleg Ruchayskiy. "String field theory vertices, integrability and boundary states." Journal of High Energy Physics 2003, no. 11 (2003): 045. http://dx.doi.org/10.1088/1126-6708/2003/11/045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Avdonin, Sergei, and Julian Edward. "An Inverse Problem for Quantum Trees with Delta-Prime Vertex Conditions." Vibration 3, no. 4 (2020): 448–63. http://dx.doi.org/10.3390/vibration3040028.

Full text

Abstract:

In this paper, we consider a non-standard dynamical inverse problem for the wave equation on a metric tree graph. We assume that the so-called delta-prime matching conditions are satisfied at the internal vertices of the graph. Another specific feature of our investigation is that we use only one boundary actuator and one boundary sensor, all other observations being internal. Using the Neumann-to-Dirichlet map (acting from one boundary vertex to one boundary and all internal vertices) we recover the topology and geometry of the graph together with the coefficients of the equations.

APA, Harvard, Vancouver, ISO, and other styles

7

Alexandrov, Stepan Andreevich, Nikolay Vladimirovich Bogachev, Andrei Yurievich Vesnin, and Andrei Aleksandrovich Egorov. "On volumes of hyperbolic right-angled polyhedra." Sbornik: Mathematics 214, no. 2 (2023): 148–65. http://dx.doi.org/10.4213/sm9740e.

Full text

Abstract:

New upper bounds for the volumes of right-angled polyhedra in hyperbolic space $\mathbb{H}^3$ are obtained in the following three cases: for ideal polyhedra with all vertices on the ideal hyperbolic boundary; for compact polyhedra with only finite vertices; and for finite-volume polyhedra with vertices of both types. Bibliography: 23 titles.

APA, Harvard, Vancouver, ISO, and other styles

8

Shastry, Aditya, and Nidhi Khandelwal. "Antibandwidth of a Graph." Mapana - Journal of Sciences 11, no. 4 (2012): 59–64. http://dx.doi.org/10.12723/mjs.23.4.

Full text

Abstract:

The antibandwidth problem consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximized. This problem is NP- hard. In this paper, we find some bounds for antibandwidth using some invariants of graphs. We prove that considerating the interior boundary and the exterior boundary when estimating the antibandwidth of connected graphs gives the same results.

APA, Harvard, Vancouver, ISO, and other styles

9

Yahya Mohamed, S., and N. Subashini. "Bipolar fuzzy graphs based on boundary and interior vertices." Malaya Journal of Matematik S, no. 1 (2020): 506–10. http://dx.doi.org/10.26637/mjm0s20/0096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Lingyun, and Weigen Yan. "Spanning Trees of the Generalised Union Jack Lattice." Zeitschrift für Naturforschung A 71, no. 4 (2016): 331–35. http://dx.doi.org/10.1515/zna-2015-0415.

Full text

Abstract:

AbstractThe Union Jack lattice UJL(n, m) with toroidal boundary condition can be obtained from an n×m square lattice with toroidal boundary condition by inserting a new vertex vf to each face f and adding four edges (vf, ui(f)), where u1(f), u2(f), u3(f), and u4(f) are four vertices on the boundary of f. The Union Jack lattice has been studied extensively by statistical physicists. In this article, we consider the problem of enumeration of spanning trees of the so-called generalised Union Jack lattice UDn, which is obtained from the Aztec diamond $AD_n^t$ of order n with toroidal boundary condition by inserting a new vertex vf to each face f and adding four edges (vf, ui(f)), where u1(f), u2(f), u3(f) and u4(f) are four vertices on the boundary of f.

APA, Harvard, Vancouver, ISO, and other styles

More sources

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!