• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3316-3332
• /
• 2019

In a transitive signature scheme, a signer wants to authenticate edges in a dynamically growing and transitively closed graph. Using transitive signature schemes it is possible to authenticate an edge (i, k), if the signer has already authenticated two edges (i, j) and (j, k). That is, it is possible to make a signature on (i, k) using two signatures on (i, j) and (j, k). We propose the first transitive signature schemes for undirected graphs from lattices. Our first scheme is provably secure in the random oracle model and our second scheme is provably secure in the standard model.

• Korean Journal of Mathematics
• /
• v.27 no.3
• /
• pp.613-627
• /
• 2019

Consider a connected molecular graph G = (V, E) where V is the set of vertices and E is the set of edges. In G, vertices represent the atoms and edges represent the covalent bonds between atoms. In graph G, every edge (say) e = uv will be connected by two atoms u and v. The edge Szeged index is a topological index which has been introduced by Ivan Gutman. In this paper, we have computed edge Szeged indices of a hydrocarbon family called Benzene ring and is denoted by $(BR)_{n{\times}n}$.

• Journal of Korea Multimedia Society
• /
• v.22 no.9
• /
• pp.983-991
• /
• 2019

Histogram equalization method is a popular contrast enhancement technique. However, there are some drawbacks, namely, over-enhancement, under-enhancement, structure information loss, and noise amplification. In this paper, we propose an edge-enhancing histogram equalization algorithm while suppressing over-enhancement simultaneously. Firstly, over-enhancement is suppressed by clipping a transfer function, then, edge enhancement is achieved by using guided image filter. Experiments are carried out to evaluate the performance of the various HE algorithms. As a result, both qualitative and quantitative assessment showed that the proposed algorithm successfully suppressed over-enhancement while enhancing edges.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.569-583
• /
• 2019

Given a graph G, the Motzkin and Straus formulation of the maximum clique problem is the quadratic program (QP) formed from the adjacent matrix of the graph G over the standard simplex. It is well-known that the global optimum value of this QP (called Lagrangian) corresponds to the clique number of a graph. It is useful in practice if similar results hold for hypergraphs. In this paper, we attempt to explore the relationship between the Lagrangian of a hypergraph and the order of its maximum cliques when the number of edges is in a certain range. Specifically, we obtain upper bounds for the Lagrangian of a hypergraph when the number of edges is in a certain range. These results further support a conjecture introduced by Y. Peng and C. Zhao (2012) and extend a result of J. Talbot (2002). We also establish an upper bound of the clique number in terms of Lagrangians for hypergraphs.

• International Journal of Computer Science & Network Security
• /
• v.21 no.5
• /
• pp.9-15
• /
• 2021

It is a challenge for visually impaired people to access unfamiliar environments independently, hence the quality of life is reduced, and safety of life is compromised. An accurate and reliable door detection system comprising of way finding and indoor navigation can be beneficial for a large number of autonomous and mobile applications for visually impaired people. This paper illustrates an image-based door detection scheme for visually impaired people using stable features (edges and corners) including color averaging and image resizing. Simulation results show that the proposed scheme shows a significant improvement when compared with existing scheme.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.48-58
• /
• 2022

Blind restoration for motion-blurred images is always the research hotspot, and the key for the blind restoration is the accurate blur kernel (BK) estimation. Therefore, to achieve high-quality blind image restoration, this thesis presents a novel windowed-total-variation method. The proposed method is based on the spatial scale of edges but not amplitude, and the proposed method thus can extract useful image edges for accurate BK estimation, and then recover high-quality clear images. A large number of experiments prove the superiority.

• Structural Engineering and Mechanics
• /
• v.86 no.3
• /
• pp.361-371
• /
• 2023

Boundary condition is an important factor affecting the vibration characteristics of structures, under different boundary conditions, structures will exhibit different vibration behaviors. On the basis of the previous work, this paper extends to the nonlinear resonance behavior of axially moving graphene platelets reinforced metal foams (GPLRMF) plates with geometric imperfection under different boundary conditions. Based on nonlinear Kirchhoff plate theory, the motion equations are derived. Considering three boundary conditions, including four edges simply supported (SSSS), four edges clamped (CCCC), clamped-clamped-simply-simply (CCSS), the nonlinear ordinary differential equation system is obtained by Galerkin method, and then the equation system is solved to obtain the nonlinear ordinary differential control equation which only including transverse displacement. Subsequently, the resonance response of GPLRMF plates is obtained by perturbation method. Finally, the effects of different boundary conditions, material properties (including the GPLs patterns, foams distribution, porosity coefficient and GPLs weight fraction), geometric imperfection, and axial velocity on the resonance of GPLRMF plates are investigated.

• Journal of applied mathematics & informatics
• /
• v.41 no.3
• /
• pp.615-631
• /
• 2023

A power cordial labeling of a graph G = (V (G), E(G)) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))ⁿ or f(v) = (f(u))ⁿ, For some n ∈ ℕ ∪ {0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we investigate power cordial labeling for helm graph, flower graph, gear graph, fan graph and jewel graph as well as larger graphs obtained from star and bistar using graph operations.

• Journal of applied mathematics & informatics
• /
• v.42 no.2
• /
• pp.353-366
• /
• 2024

A total coloring of a graph G is an assignment of colors to both the vertices and edges of G, such that no two adjacent or incident vertices and edges of G are assigned the same colors. In this paper, we have discussed the total coloring of M(T_n), M(D_n), M(DT_n), M(AT_n), M(DA(T_n)), M(Q_n), M(AQ_n) and also obtained the total chromatic number of M(T_n), M(D_n), M(DT_n), M(AT_n), M(DA(T_n)), M(Q_n), M(AQ_n).

• Journal of applied mathematics & informatics
• /
• v.42 no.2
• /
• pp.445-456
• /
• 2024

A power cordial labeling of a graph G = (V (G), E(G)) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))ⁿ or f(v) = (f(u))ⁿ, for some n ∈ ℕ ∪ {0} {0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we study power cordial labeling and investigate power cordial labeling for some standard graph families.