Your selections:

4Miller, Mirka
3Lin, Yuqing
2Balbuena, Camino
1Aytar, Salih
1Barker, Ewan
1Baskoro, Edy
1Cholily, Yus Mochamad
1Dsouza, Shaima
1Mammadov, Musa
1Marcote, Xavier
1Natarajan, Sundarajan
1Ooi, Ean Tat
1Pehlivan, Serpil
1Pramod, A. L. N.
1Rodger, Chris
1Song, Chongming
1Sugeng, Kiki Ariyanti

Show More

Show Less

50101 Pure Mathematics
4Graph theory
2(k,g)-cage
2Connectivity
2Numerical methods
2Theorem proving
10102 Applied Mathematics
10905 Civil Engineering
10913 Mechanical Engineering
1Algorithms
1Almost Moore digraph
1Bi-material interfaces
1Boundary conditions
1Computation theory
1Condition numbers
1Conforming finite element method
1Consecutive magic labeling
1Convergence of numerical methods
1Dirichlet boundary condition

Show More

Show Less

All (k;g)-cages are k-edge-connected

- Lin, Yuqing, Miller, Mirka, Rodger, Chris

**Authors:**Lin, Yuqing , Miller, Mirka , Rodger, Chris**Date:**2005**Type:**Text , Journal article**Relation:**Journal of Graph Theory Vol. 48, no. 3 (2005), p. 219-227**Full Text:**false**Reviewed:****Description:**A (k;g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In this paper, we prove that (k;g)-cages are k-edge-connected if g is even. Earlier, Wang, Xu, and Wang proved that (k;g)-cages are k-edge-connected if g is odd. Combining our results, we conclude that the (k;g)-cages are k-edge-connected. © 2005 wiley Periodicals, Inc.**Description:**C1

Statistical limit inferior and limit superior for sequences of fuzzy numbers

- Aytar, Salih, Mammadov, Musa, Pehlivan, Serpil

**Authors:**Aytar, Salih , Mammadov, Musa , Pehlivan, Serpil**Date:**2006**Type:**Text , Journal article**Relation:**Fuzzy Sets and Systems Vol. 157, no. 7 (2006), p. 976-985**Full Text:**false**Reviewed:****Description:**In this paper, we extend the concepts of statistical limit superior and limit inferior (as introduced by Fridy and Orhan [Statistical limit superior and limit inferior, Proc. Amer. Math. Soc. 125 (12) (1997) 3625-3631. [12]]) to statistically bounded sequences of fuzzy numbers and give some fuzzy-analogues of properties of statistical limit superior and limit inferior for sequences of real numbers. © 2005 Elsevier B.V. All rights reserved.**Description:**C1**Description:**2003001832

Enumerations of vertex orders of almost Moore digraphs with selfrepeats

- Baskoro, Edy, Cholily, Yus Mochamad, Miller, Mirka

**Authors:**Baskoro, Edy , Cholily, Yus Mochamad , Miller, Mirka**Date:**2008**Type:**Text , Journal article**Relation:**Discrete Mathematics Vol. 308, no. 1 (2008), p. 123-128**Full Text:**false**Reviewed:****Description:**An almost Moore digraph G of degree d > 1, diameter k > 1 is a diregular digraph with the number of vertices one less than the Moore bound. If G is an almost Moore digraph, then for each vertex u ∈ V (G) there exists a vertex v ∈ V (G), called repeat of u and denoted by r (u) = v, such that there are two walks of length ≤ k from u to v. The smallest positive integer p such that the composition rp (u) = u is called the order of u. If the order of u is 1 then u is called a selfrepeat. It is known that if G is an almost Moore digraph of diameter k ≥ 3 then G contains exactly k selfrepeats or none. In this paper, we propose an exact formula for the number of all vertex orders in an almost Moore digraph G containing selfrepeats, based on the vertex orders of the out-neighbours of any selfrepeat vertex. © 2007 Elsevier B.V. All rights reserved.**Description:**C1

Robust modelling of implicit interfaces by the scaled boundary finite element method

- Dsouza, Shaima, Pramod, A. L. N., Ooi, Ean Tat, Song, Chongming, Natarajan, Sundarajan

**Authors:**Dsouza, Shaima , Pramod, A. L. N. , Ooi, Ean Tat , Song, Chongming , Natarajan, Sundarajan**Date:**2021**Type:**Text , Journal article**Relation:**Engineering Analysis with Boundary Elements Vol. 124, no. (2021), p. 266-286**Full Text:**false**Reviewed:****Description:**In this paper, we propose a robust framework based on the scaled boundary finite element method to model implicit interfaces in two-dimensional differential equations in nonhomegeneous media. The salient features of the proposed work are: (a) interfaces can be implicitly defined and need not conform to the background mesh; (b) Dirichlet boundary conditions can be imposed directly along the interface; (c) does not require special numerical integration technique to compute the bilinear and the linear forms and (d) can work with an efficient local mesh refinement using hierarchical background meshes. Numerical examples involving straight interface, circular interface and moving interface problems are solved to validate the proposed technique. Further, the presented technique is compared with conforming finite element method in terms of accuracy and convergence. From the numerical studies, it is seen that the proposed framework yields solutions whose error is O(h2) in L2 norm and O(h) in the H1 semi-norm. Further the condition number increases with the mesh size similar to the FEM. © 2021 Elsevier Ltd

- Balbuena, Camino, Barker, Ewan, Lin, Yuqing, Miller, Mirka, Sugeng, Kiki Ariyanti

**Authors:**Balbuena, Camino , Barker, Ewan , Lin, Yuqing , Miller, Mirka , Sugeng, Kiki Ariyanti**Date:**2006**Type:**Text , Journal article**Relation:**Discrete Mathematics Vol. 306, no. 16 (2006), p. 1817-1829**Full Text:**false**Reviewed:****Description:**Let G be a graph of order n and size e. A vertex-magic total labeling is an assignment of the integers 1, 2, ..., n + e to the vertices and the edges of G, so that at each vertex, the vertex label and the labels on the edges incident at that vertex, add to a fixed constant, called the magic number of G. Such a labeling is a-vertex consecutive magic if the set of the labels of the vertices is { a + 1, a + 2, ..., a + n }, and is b-edge consecutive magic if the set of labels of the edges is { b + 1, b + 2, ..., b + e }. In this paper we prove that if an a-vertex consecutive magic graph has isolated vertices then the order and the size satisfy (n - 1)**Description:**C1**Description:**2003001604

On the connectivity of (k, g)-cages of even girth

- Lin, Yuqing, Balbuena, Camino, Marcote, Xavier, Miller, Mirka

**Authors:**Lin, Yuqing , Balbuena, Camino , Marcote, Xavier , Miller, Mirka**Date:**2008**Type:**Text , Journal article**Relation:**Discrete Mathematics Vol. 308, no. 15 (2008), p. 3249-3256**Full Text:**false**Reviewed:****Description:**A (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In this paper we give a brief overview of the current results on the connectivity of (k,g)-cages and we improve the current known best lower bound on the vertex connectivity of (k,g)-cages for g even. © 2007 Elsevier B.V. All rights reserved.**Description:**C1

- «
- ‹
- 1
- ›
- »

Are you sure you would like to clear your session, including search history and login status?