• 제목/요약/키워드: inverse graphs

검색결과 15건 처리시간 0.026초

Inverse of Frobenius Graphs and Flexibility

  • Aljouiee, Abdulla
    • Kyungpook Mathematical Journal
    • /
    • 제45권4호
    • /
    • pp.561-570
    • /
    • 2005
  • Weak Crossed Product Algebras correspond to certain graphs called lower subtractive graphs. The properties of such algebras can be obtained by studying this kind of graphs ([4], [5]). In [1], the author showed that a weak crossed product is Frobenius and its restricted subalgebra is symmetric if and only if its associated graph has a unique maximal vertex. A special construction of these graphs came naturally and was known as standard lower subtractive graph. It was a deep question that when such a special graph possesses unique maximal vertex? This work is to answer the question partially and to give a particular characterization for such graphs at which the corresponding algebras are isomorphic. A graph that follows the mentioned characterization is called flexible. Flexibility is to some extend a generalization of the so-called Coxeter groups and its weak Bruhat ordering.

  • PDF

On Diameter, Cyclomatic Number and Inverse Degree of Chemical Graphs

  • Sharafdini, Reza;Ghalavand, Ali;Ashrafi, Ali Reza
    • Kyungpook Mathematical Journal
    • /
    • 제60권3호
    • /
    • pp.467-475
    • /
    • 2020
  • Let G be a chemical graph with vertex set {v1, v1, …, vn} and degree sequence d(G) = (degG(v1), degG(v2), …, degG(vn)). The inverse degree, R(G) of G is defined as $R(G)={\sum{_{i=1}^{n}}}\;{\frac{1}{deg_G(v_i)}}$. The cyclomatic number of G is defined as γ = m - n + k, where m, n and k are the number of edges, vertices and components of G, respectively. In this paper, some upper bounds on the diameter of a chemical graph in terms of its inverse degree are given. We also obtain an ordering of connected chemical graphs with respect to the inverse degree.

AUGMENTED INVERSE GRAPHS WITH RESPECT TO A GROUP

  • M. LAKSHMI KAMESWARI;N. NAGA MARUTHI KUMARI;T.V. PRADEEP KUMAR
    • Journal of applied mathematics & informatics
    • /
    • 제41권2호
    • /
    • pp.287-293
    • /
    • 2023
  • In this paper, the Augmented graph Es(τ) of the inverse graph Gs(τ) of a cyclic group (τ,◦) was studied. The Augmented inverse graph was constructed by applying the method of Mycielski's construction. The dimension of Augmented inverse graph and different properties of the graph were investigated. Later the chromatic number of Augmented inverse graph was discussed and the relation between the maximum degree of the graph and the chromatic number was established. In the Mycielski's construction, the properties of the key node 'u' in Es (τ) were established based on cardinality of the cyclic group (τ,◦) and also proved that the Augmented inverse graph Es(τ) was a triangle free graph.

SUFFICIENT CONDITIONS FOR SOME HAMILTONIAN PROPERTIES AND K-CONNECTIVITY OF GRAPHS

  • LI, RAO
    • Journal of applied mathematics & informatics
    • /
    • 제34권3_4호
    • /
    • pp.221-225
    • /
    • 2016
  • For a connected graph G = (V, E), its inverse degree is defined as $\sum_{{\upsilon}{\in}{V}}^{}\frac{1}{d(\upsilon)}$. Using an upper bound for the inverse degree of a graph obtained by Cioabă in [4], we in this note present sufficient conditions for some Hamiltonian properties and k-connectivity of a graph.

DISCRETE EVOLUTION EQUATIONS ON NETWORKS AND A UNIQUE IDENTIFIABILITY OF THEIR WEIGHTS

  • Chung, Soon-Yeong
    • 대한수학회지
    • /
    • 제53권5호
    • /
    • pp.1133-1148
    • /
    • 2016
  • In this paper, we first discuss a representation of solutions to the initial value problem and the initial-boundary value problem for discrete evolution equations $${\sum\limits^l_{n=0}}c_n{\partial}^n_tu(x,t)-{\rho}(x){\Delta}_{\omega}u(x,t)=H(x,t)$$, defined on networks, i.e. on weighted graphs. Secondly, we show that the weight of each link of networks can be uniquely identified by using their Dirichlet data and Neumann data on the boundary, under a monotonicity condition on their weights.

전과정을 고려한 에너지 자원별 전력생산의 온실가스 배출량과 비용의 상관관계 분석 (Life cycle analysis on correlation relationship between GHG emission and cost of electricity generation system for energy resources)

  • 김희태;안태규
    • 한국신재생에너지학회:학술대회논문집
    • /
    • 한국신재생에너지학회 2011년도 춘계학술대회 초록집
    • /
    • pp.136.2-136.2
    • /
    • 2011
  • In this work, we analyzed correlations between life-cycle greenhouse gas (GHG) emissions and life-cycle cost of energy resources. Energy resources studied in this paper include coal, natural gas, nuclear power, hydropower, geothermal energy, wind power, solar thermal energy, and solar photovoltaic energy, and all of them are used to generate electricity. We calculated the mean values, ranges of maximum minus minimum values, and ranges of 90% confidence interval of life-cycle GHG emissions and life-cycle cost of each energy resource. Based on the values, we plotted them in two dimensional graphs to analyze a relationship and characteristics between GHG emissions and cost. Besides, to analyze the technical maturity, the GHG emissions and the range of minimum and maximum values were compared to each other. For the electric generation, energy resources are largely inverse proportional to the GHG emission and the corresponding cost.

  • PDF

AN UPPER BOUND ON THE CHEEGER CONSTANT OF A DISTANCE-REGULAR GRAPH

  • Kim, Gil Chun;Lee, Yoonjin
    • 대한수학회보
    • /
    • 제54권2호
    • /
    • pp.507-519
    • /
    • 2017
  • We present an upper bound on the Cheeger constant of a distance-regular graph. Recently, the authors found an upper bound on the Cheeger constant of distance-regular graph under a certain restriction in their previous work. Our new bound in the current paper is much better than the previous bound, and it is a general bound with no restriction. We point out that our bound is explicitly computable by using the valencies and the intersection matrix of a distance-regular graph. As a major tool, we use the discrete Green's function, which is defined as the inverse of ${\beta}$-Laplacian for some positive real number ${\beta}$. We present some examples of distance-regular graphs, where we compute our upper bound on their Cheeger constants.

GSP를 활용한 수학과 교육자료 개발 연구 -중학교 함수의 그래프를 중심으로- (A Study on the Development of Teaching Material using GSP in Mathematics Education -Focused on the graph of function of Middle School-)

  • 신영섭
    • 한국학교수학회논문집
    • /
    • 제2권1호
    • /
    • pp.93-104
    • /
    • 1999
  • The subject of this study was the graph of relation of direct inverse proportion, linear function and quadratic function in the 1st, 2nd and 3rd grade of current middle school mathematics curriculum. GSP materials were developed to simplify the principle, trait and characteristics of graphs and make them easier to understand. The overall aim of the materials is to improve the effectiveness of teaching and learning through the utilization of enhanced students' practice. Additionally, the use of the GSP will be useful in the development of mere effective materials. The effectiveness of the GSP materials will be as followings. 1. The step by step approach of GSP materials through computer interaction will enhance students motivation and interest in mathematics. 2. By presenting the subject matter simply and in a variety of ways, difficult concepts can be understood without the use of complex mathematical calculation. 3. The GSP program is different from CAI and other software programs. It should be used only after learning how to input and output data.

  • PDF

EXACT SOLUTIONS OF GENERALIZED STOKES' PROBLEMS FOR AN INCOMPRESSIBLE COUPLE STRESS FLUID FLOWS

  • SIDDIQUE, IMRAN;UMBREEN, YOUSRA
    • Journal of applied mathematics & informatics
    • /
    • 제37권5_6호
    • /
    • pp.507-519
    • /
    • 2019
  • The ground for this paper is to examine the generalized Stokes' first and second issues for an incompressible couple pressure liquid under isothermal conditions. Exact solutions for each problem are acquired by using the Laplace transform (LT) with respect to the time variable t and the sine Fourier transform (FT) with respect to the y-variable. Further, a comparison is given of the obtained results and the results of Devakar and Lyengar [1] and by using the four inverse Laplace transform algorithms (Stehfest's, Tzou's, Talbot, Fourier series) in the space time domain utilizing a numerical methodology. Moreover, velocity profiles are plotted and considered for various occasions and distinctive estimations of couple stress parameters. At the end, the outcomes are exhibited by graphs and in tabular forms.

A STUDY OF THE RIGHT LOCAL GENERAL TRUNCATED M-FRACTIONAL DERIVATIVE

  • Chauhan, Rajendrakumar B.;Chudasama, Meera H.
    • 대한수학회논문집
    • /
    • 제37권2호
    • /
    • pp.503-520
    • /
    • 2022
  • We introduce a new type of fractional derivative, which we call as the right local general truncated M-fractional derivative for α-differentiable functions that generalizes the fractional derivative type introduced by Anastassiou. This newly defined operator generalizes the standard properties and results of the integer order calculus viz. the Rolle's theorem, the mean value theorem and its extension, inverse property, the fundamental theorem of calculus and the theorem of integration by parts. Then we represent a relation of the newly defined fractional derivative with known fractional derivative and in context with this derivative a physical problem, Kirchoff's voltage law, is generalized. Also, the importance of this newly defined operator with respect to the flexibility in the parametric values is described via the comparison of the solutions in the graphs using MATLAB software.