Result 1 to 20 of 190 total
Minimum rank of powers of trees. (English)
Electron. J. Linear Algebra 23, 151-163, electronic only (2012).
1
Applying power graph analysis to weighted graphs. (English)
Baeza-Yates, Ricardo (ed.) et al., Advances in information retrieval. 34th European conference on IR research, ECIR 2012, Barcelona, Spain, April 1‒5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28996-5/pbk). Lecture Notes in Computer Science 7224, 548-551 (2012).
2
Typical distances in ultrasmall random networks. (English)
Adv. Appl. Probab. 44, No. 2, 583-601 (2012).
3
On relaxing the constraints in pairwise compatibility graphs. (English)
Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 6th international workshop, WALCOM 2012, Dhaka, Bangladesh, February 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28075-7/pbk). Lecture Notes in Computer Science 7157, 124-135 (2012).
4
Clawfreeness of the powers of a graph. (English)
Discrete Appl. Math. 160, No. 9, 1390-1393 (2012).
5
The minimum identifying code graphs. (English)
Discrete Appl. Math. 160, No. 9, 1385-1389 (2012).
6
On antimagic labeling for power of cycles. (English)
Ars Comb. 98, 161-165 (2011).
7
A generalization for directed scale-free graphs. (English)
OR Trans. 15, No. 1, 35-45 (2011).
8
Graph grammars with string-regulated rewriting. (English)
Theor. Comput. Sci. 412, No. 43, 6101-6111 (2011).
9
Some results on the complement of the zero-divisor graph of a commutative ring. (English)
J. Algebra Appl. 10, No. 3, 573-595 (2011).
10
How to become a group leader ‒ or modeling author types based on graph mining. (English)
Gradmann, Stefan (ed.) et al., Research and advanced technology for digital libraries. International conference on theory and practice of digital libraries, TPDL 2011, Berlin, Germany, September 26‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24468-1/pbk). Lecture Notes in Computer Science 6966, 15-26 (2011).
11
On the sizes of graphs and their powers: the undirected case. (English)
Discrete Appl. Math. 159, No. 16, 1666-1675 (2011).
12
On the power domination number of the generalized Petersen graphs. (English)
J. Comb. Optim. 22, No. 2, 282-291 (2011).
13
Disjoint sets in graphs and its application to electrical networks. (English)
J. Math. Stat. 7, No. 1, 73-77 (2011).
14
Scale-free graphs of increasing degree. (English)
Random Struct. Algorithms 38, No. 4, 396-421 (2011).
15
A preconditioning approach to the pagerank computation problem. (English)
Linear Algebra Appl. 435, No. 9, 2222-2246 (2011).
16
The minimum upper bound on the first ambiguous power of an irreducible, nonpowerful ray or sign pattern. (English)
Linear Algebra Appl. 435, No. 5, 1147-1156 (2011).
17
Small subgraphs in random graphs and the power of multiple choices. (English)
J. Comb. Theory, Ser. B 101, No. 4, 237-268 (2011).
18
Enumeration of spanning trees of graph: alternative methods. (English)
Int. J. Math. Oper. Res. 3, No. 2, 170-185 (2011).
19
A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents. (English)
Discrete Event Dyn. Syst. 21, No. 1, 41-61 (2011).
20
Result 1 to 20 of 190 total
Start
Contact
Print
General Help
