Result 1 to 19 of 19 total
Total coloring of certain double vertex graphs. (English)
Appl. Math. Sci., Ruse 5, No. 45-48, 2271-2275 (2011).
1
The medium domination number of a graph. (English)
Int. J. Pure Appl. Math. 70, No. 3, 297-306 (2011).
2
Solitude number at graphs. (English)
Int. J. Pure Appl. Math. 66, No. 3, 355-364 (2011).
3
Average edge-distance in graphs. (English)
Selçuk J. Appl. Math. 11, No. 2, 63-70 (2010).
4
Weak and strong reinforcement number for a graph. (English)
Int. J. Math. Comb. 3, 91-97 (2010).
5
Vulnerability of generalized Petersen graphs via invariants. (English)
Int. J. Pure Appl. Math. 37, No. 4, 513-522 (2007).
6
The edge-accessibility number of network models. (English)
Int. J. Pure Appl. Math. 33, No. 2, 187-194 (2006).
7
Calculation of the accessibility number and the neighbor integrity of a graph. (English)
Math. Notes 78, No. 5, 631-640 (2005); translation from Mat. Zametki 78, No. 5, 631-640 (2005).
8
The minimization of Boolean function using Hamiltonian cycles. (English)
Int. J. Pure Appl. Math. 24, No. 3, 425-433 (2005).
9
Integrity of total graphs via certain parameters. (English)
Math. Notes 76, No. 5, 665-672 (2004); translation from Mat. Zametki 76, No. 5, 714-722 (2004).
10
Finding a fault tolerant routing on neighbour-faulty hypercube. (English)
Int. J. Comput. Math. 81, No. 9, 1043-1049 (2004).
11
Stability measures of some static interconnection networks. (English)
Int. J. Comput. Math. 76, No.4, 455-462 (2001).
12
On the neighbour-integrity of sequential joined graphs. (English)
Int. J. Comput. Math. 74, No.1, 45-52 (2000).
13
The neighbour-integrity of Boolean graphs and its compounds. (English)
Int. J. Comput. Math. 72, No.4, 441-447 (1999).
14
The integrity of derived graph. (English)
J. Fac. Sci., Ege Univ., Ser. A-B 20, No. 1-2, 115-123 (1997).
15
The Steiner distance of diamond graph. (English)
J. Fac. Sci., Ege Univ., Ser. A-B 20, No. 1-2, 19-24 (1997).
16
Envelope graph and its clique partition number. (English)
J. Fac. Sci., Ege Univ., Ser. A-B 19, No.2, 23-31 (1996).
17
The stochastic processes of logic circuits. (English)
J. Fac. Sci., Ege Univ., Ser. A 17, No.2, 65-73 (1994).
18
The realization of Boolean function with minimun contact by $B\sb n$ graph. (English)
J. Fac. Sci., Ege Univ., Ser. A 12, No.2, 61-67 (1989).
19
Result 1 to 19 of 19 total
Start
Contact
Print
General Help
