ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Mathematics
Technology
Education
Computing
Architecture and Urbanism
Computing
Literature
Languages
Social Sciences
Research
all records (75)

Languages
English
Spanish
German
Portuguese
French
Finnish

Countries
Indonesia
USA
Australia
Brazil
Ukraine
Italy
Chile
South Africa
Canada
Romania
all records (75)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
11.085  Articles
1 of 1.109 pages  |  10  records  |  more records»
In this paper, the mathematical problem of automation of encoding a communication/transportation network is considered for enabling design of appropriate plans for ground-troopmovement on a complex terrain that motivated to discuss a general method of con... see more

We generalise to signed graphs a classical result of Tutte [Canad. J. Math. 8 (1956), 13—28] stating that every integer flow can be expressed as a sum of characteristic flows of circuits. In our generalisation, the rôle of circuits is taken over by signed... see more

A Smarandachely k-signed graph (Smarandachely k-marked graph) is anordered pair....DOI : http://dx.doi.org/10.22342/jims.16.2.34.105-113

In this paper we define graceful center of a graceful graph. We proved any graph G which admits a-labeling has at least four graceful centers. We also defined a new strong concept of universal graceful graph. Some results on ring sum of two... see more

A connected graph G = (V, E) of order atleast two, with order p and size q is called vertex-graceful if there exists a bijection f : V ? {1, 2, 3, ··· p} such that the induced function f * : E ? {0, 1, 2, ··· q - 1} defined by f * (uv) = (f(u) + f(v))(mod... see more

Let G be a graph with vertex set V = V(G) and edge set E = E(G). An injective function f : V ? {0, 1, 2, ..., |E|} is called graceful labeling if f induces a function f * (uv) = |f(u) - f(v)| which is a bijection from E(G) to the set {1, 2, 3, ..., |E|}. ... see more

For positive integers m, n, Km, n represents the complete bipartite graph. We name the graph G = Km, n ? K2 as triangular extension of complete bipartite graph Km, n, since there is a triangle hanging from every vertex of Km, n. In this paper we show that... see more

For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that eac... see more

A signed graph is a pair G=(G,s), where G=(V(G), E(G)) is a graph and s: E(G) ? {+1, -1} is the sign function on the edges of G. For a signed graph we consider the least eigenvalue ?(G) of the Laplacian matrix defined as L(G)=D(G)-A(G), where D(G) is the ... see more

1 of 1.109 pages  |  10  records  |  more records»